Theory and Applications of Satisfiability Testing

DOI10.1007/11527695MaRDI QIDQ5714746zbMATH OpenOpenAlexFDO

Authors Ravi Gummadi, N. S. Narayanaswamy, R. Venkatakrishnan

Publication date 16 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11527695

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A note on the use of independent sets for the \(k\)-SAT problem
• A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
• An improved exponential-time algorithm for k -SAT
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 1670827

Cited in

(5)

• A note on the use of independent sets for the \(k\)-SAT problem
• Metalevel algorithms for variant satisfiability
• scientific article; zbMATH DE number 1931668 (Why is no real title available?)
• Variant-Based Satisfiability in Initial Algebras
• Algorithms for four variants of the exact satisfiability problem

This page was built for publication: Theory and Applications of Satisfiability Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714746)