The Complexity of Counting Functions with Easy Decision Version
From MaRDI portal
Publication:5756679
DOI10.1007/11821069_64zbMath1132.68425OpenAlexW1782691830MaRDI QIDQ5756679
Stathis Zachos, Aris Pagourtzis
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_64
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (10)
Completeness Results for Counting Problems with Easy Decision ⋮ Stathis Zachos at 70! ⋮ Complexity of counting the optimal solutions ⋮ Completeness, approximability and exponential time results for counting problems with easy decision version ⋮ Unnamed Item ⋮ On the connection between interval size functions and path counting ⋮ Complexity of Counting the Optimal Solutions ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ On the autoreducibility of functions ⋮ Counting of Teams in First-Order Team Logics
This page was built for publication: The Complexity of Counting Functions with Easy Decision Version
