Algorithms for satisfiability using independent sets of variables

DOI10.1007/11527695_11MaRDI 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
• Deterministic algorithms for k-SAT based on covering codes and local search

Cited in

(5)

• Metalevel algorithms for variant satisfiability
• Variant-Based Satisfiability in Initial Algebras
• Dependent and independent variables in propositional satisfiability
• A note on the use of independent sets for the k-SAT problem
• Algorithms for four variants of the exact satisfiability problem

This page was built for publication: Algorithms for satisfiability using independent sets of variables

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