Solving #SAT Using Vertex Covers

DOI10.1007/11814948_36zbMath1187.68263OpenAlexW1752314164MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

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 ⋮ Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search ⋮ Learning to assign degrees of belief in relational domains

This page was built for publication: Solving #SAT Using Vertex Covers