scientific article; zbMATH DE number 2086385

MaRDI QIDQ4736839zbMATH OpenFDO

Authors Thomas Hofmeister, Rainer Schuler, Osamu Watanabe, Uwe Schöning

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850192.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Randomized algorithms for 3-SAT
• Theory and Applications of Satisfiability Testing
• Improved randomized algorithms for 3-SAT
• A probabilistic algorithm for k-SAT based on limited local search and restart
• scientific article; zbMATH DE number 515744

Cited in

(31)

• Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
• New methods for 3-SAT decision and worst-case analysis
• Solving and sampling with many solutions
• Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT
• The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
• Theoretical advances in artificial immune systems
• Discrete quantum walks hit exponentially faster
• On converting CNF to DNF
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Exploiting partial knowledge of satisfying assignments
• Improved polynomial algorithm for 3-SAT
• Improved randomized algorithms for 3-SAT
• An improved local search algorithm for 3-SAT
• Improved bound for the PPSZ/Schöning-algorithm for 3-SAT
• A spectral technique for random satisfiable 3CNF formulas
• scientific article; zbMATH DE number 515744 (Why is no real title available?)
• Chain, generalization of covering code, and deterministic algorithm for \(k\)-SAT
• Walksat Stalls Well Below Satisfiability
• Theory and Applications of Satisfiability Testing
• A full derandomization of Schöning's \(k\)-\textsc{SAT} algorithm
• Guided Search and a Faster Deterministic Algorithm for 3-SAT
• STACS 2005
• Theory and Applications of Satisfiability Testing
• An improvement of the algorithm of Hertli for the unique 3SAT problem
• An improvement of the algorithm of Hertli for the unique 3SAT problem
• Algorithms for four variants of the exact satisfiability problem
• An improved deterministic local search algorithm for 3-SAT
• Foundations of \(r\)-contiguous matching in negative selection for anomaly detection
• Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments
• Randomized algorithms for 3-SAT
• Modelling the dynamics of stochastic local search on \(k\)-SAT

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 Q4736839)