scientific article; zbMATH DE number 1848397

zbMATH Open1002.68641MaRDI QIDQ4785576FDOQ4785576

Authors: Suguru Tamaki, Kazuo Iwama 

Publication date: 5 January 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2141/21410118

Title of this publication is not available (Why is that?)

Recommendations

• Exploiting partial knowledge of satisfying assignments
• A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
• A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
• Theory and Applications of Satisfiability Testing
• Improving PPSZ for 3-SAT using critical variables

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cited In (2)

• Exploiting partial knowledge of satisfying assignments
• Whose side are you on? Finding solutions in a biased search-tree

This page was built for publication:

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