Monotone arithmetic complexity of graph homomorphism polynomials

Show simple item record

dc.contributor.author Komarath, Balagopal
dc.contributor.author Pandey, Anurag
dc.contributor.author Rahul, Chengot Sankaramenon
dc.contributor.other 49th EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2022)
dc.coverage.spatial Paris, FR
dc.date.accessioned 2022-07-13T07:10:43Z
dc.date.available 2022-07-13T07:10:43Z
dc.date.issued 04-07-22
dc.identifier.citation Komarath, Balagopal; Pandey, Anurag and Rahul, Chengot Sankaramenon, "Monotone arithmetic complexity of graph homomorphism polynomials", in the 49th EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2022), Paris, FR, Jul. 4-8, 2022. en_US
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/7884
dc.description.statementofresponsibility by Balagopal Komarath, Anurag Pandey and Chengot Sankaramenon Rahul
dc.language.iso en_US en_US
dc.title Monotone arithmetic complexity of graph homomorphism polynomials en_US
dc.type Conference Paper en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account