Solving #SAT Using Vertex Covers
From MaRDI portal
Publication:5756553
DOI10.1007/11814948_36zbMath1187.68263MaRDI QIDQ5756553
Naomi Nishimura, Stefan Szeider, Prabhakar Ragde
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11814948_36
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search, Learning to assign degrees of belief in relational domains, Algorithms for Propositional Model Counting, Complexity and Algorithms for Well-Structured k-SAT Instances, A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors