Progress in Complexity of Counting Problems
From MaRDI portal
Publication:3004647
DOI10.1007/978-3-642-21204-8_1zbMath1329.68133OpenAlexW2252421348MaRDI QIDQ3004647
Publication date: 3 June 2011
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_1
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- On the complexity of #CSP
- The Complexity of the Counting Constraint Satisfaction Problem
- Holographic Algorithms
- Holant problems and counting CSP
- The complexity of satisfiability problems
- Operations with structures
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem
- Unnamed Item