External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials

Balagopal Komarath, Anurag Pandey 0001, Chengot Sankaramenon Rahul. Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. In Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France. Volume 229 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Authors

Balagopal Komarath

This author has not been identified. Look up 'Balagopal Komarath' in Google

Anurag Pandey 0001

This author has not been identified. Look up 'Anurag Pandey 0001' in Google

Chengot Sankaramenon Rahul

This author has not been identified. Look up 'Chengot Sankaramenon Rahul' in Google
runs on