scientific article; zbMATH DE number 2086385
From MaRDI portal
Publication:4736839
zbMath1054.68138MaRDI QIDQ4736839
Rainer Schuler, Osamu Watanabe, Thomas Hofmeister, Uwe Schoening
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850192.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (18)
Exploiting partial knowledge of satisfying assignments ⋮ Algorithms for four variants of the exact satisfiability problem ⋮ Derandomizing the HSSW algorithm for 3-SAT ⋮ A spectral technique for random satisfiable 3CNF formulas ⋮ Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. ⋮ Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT ⋮ Modelling the dynamics of stochastic local search on \(k\)-SAT ⋮ Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT ⋮ The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs ⋮ An improved deterministic local search algorithm for 3-SAT ⋮ Foundations of \(r\)-contiguous matching in negative selection for anomaly detection ⋮ Theoretical advances in artificial immune systems ⋮ Solving and sampling with many solutions ⋮ Discrete quantum walks hit exponentially faster ⋮ On converting CNF to DNF ⋮ A new algorithm for optimal 2-constraint satisfaction and its implications ⋮ An improved local search algorithm for 3-SAT ⋮ Walksat Stalls Well Below Satisfiability
This page was built for publication: