A Dichotomy Theorem for Homomorphism Polynomials
From MaRDI portal
Publication:2912729
DOI10.1007/978-3-642-32589-2_29zbMath1365.68295arXiv1210.7641OpenAlexW1510132008MaRDI QIDQ2912729
Publication date: 25 September 2012
Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7641
Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Some complete and intermediate polynomials in algebraic complexity theory ⋮ On the relative power of reduction notions in arithmetic circuit complexity ⋮ Unnamed Item
This page was built for publication: A Dichotomy Theorem for Homomorphism Polynomials
