Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATH Open1122.68598OpenAlexW2483910514MaRDI QIDQ5714746FDOQ5714746

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• Metalevel algorithms for variant satisfiability
• Algorithms for four variants of the exact satisfiability problem
• A note on the use of independent sets for the \(k\)-SAT problem
• Variant-Based Satisfiability in Initial Algebras
• Title not available (Why is that?)

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)