Complexity Dichotomy for Counting Problems
From MaRDI portal
Publication:4910437
DOI10.1007/978-3-642-37064-9_1zbMath1377.68093OpenAlexW2222595297MaRDI QIDQ4910437
Publication date: 18 March 2013
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-37064-9_1
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Complexity Dichotomy for Counting Problems