Keyword

3-SAT

Description: 3-SAT is a Boolean satisfiability problem asking whether a conjunction of clauses, each containing at most three literals, can be satisfied.

Primary topic: Constraint Satisfaction and Optimization (27%)

Wikidata ID: wiki/Q339688

OpenAlex ID: keywords/3-sat

Solution of a 20-Variable 3-SAT Problem on a DNA Computer

2002 · Ravinderjit S. Braich, Nickolas Chelyapov, et al. · Science · 567

Free Bits, PCPs, and Nonapproximability---Towards Tight Results

1998 · Mihir Bellare, Oded Goldreich, et al. · SIAM Journal on Computing · 453

Random K -satisfiability problem: From an analytic solution to an efficient algorithm

2002 · Marc Mézard, Riccardo Zecchina · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · 448

PDF

A probabilistic algorithm for k-SAT and constraint satisfaction problems

2003 · T. Schoning · Annual Symposium on Foundations of Computer Science · 432

A simplified NP-complete satisfiability problem

1984 · Craig A. Tovey · Discrete Applied Mathematics · 382

PDF

Lower Bounds Based on the Exponential-Time Hypothesis

2015 · Marek Cygan, Fedor V. Fomin, et al. · Springer eBooks · 334

Computing a nonnegative matrix factorization -- provably

2012 · Sanjeev Arora, Rong Ge, et al. · ACM Symposium on Theory of Computing (STOC) · 280

Improvements to propositional satisfiability search algorithms

1995 · Jon Freeman · 265

Extremal Combinatorics: With Applications in Computer Science

2001 · Stasys Jukna · 237

A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search

2002 · Evgeny Dantsin, Andreas Goerdt, et al. · Theoretical Computer Science · 229

PDF

Experimental results on the crossover point in satisfiability problems

1993 · James M. Crawford, Larry D. Auton · 207

Experiment al Results on the Application of Sat isfiability Algorithms to Scheduling Problems

1994 · James M. Crawford, Andrew B. Baker · 193

New methods for 3-SAT decision and worst-case analysis

1999 · O. Kullmann · Theoretical Computer Science · 189

PDF

Two Query PCP with Sub-Constant Error

2008 · Dana Moshkovitz, Ran Raz · Annual Symposium on Foundations of Computer Science · 185

The complexity of analog computation

1986 · Anastasios Vergis, Kenneth Steiglitz, et al. · Mathematics and Computers in Simulation · 182

Counting Models Using Connected Components

2000 · Roberto J. Bayardo, Joseph Daniel Pehoushek · 170

Using modern graphics architectures for general-purpose computing: A framework and analysis

2002 · Chris J. Thompson, Sahngyun Hahn, et al. · 169

Approximating the unsatisfiability threshold of random formulas

1998 · Lefteris M. Kirousis, Evangelos Kranakis, et al. · Random Structures and Algorithms · 163

3-coloring in time

2004 · Richard Beigel, David Eppstein · Journal of Algorithms · 155

PDF

On the existence of subexponential parameterized algorithms

2003 · Liming Cai, David Juedes · Journal of Computer and System Sciences · 147

A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart

2002 · Schöning · Algorithmica · 135

A variational description of the ground state structure in random satisfiability problems

2000 · G. Biroli, R. Monasson, et al. · The European Physical Journal B · 135

PDF

A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae

1997 · O Dubois, Y Boufkhad · Journal of Algorithms · 135

A backbone search Heuristic for efficient solving of hard 3-SAT formulae

2001 · Olivier Dubois, Gilles Dequen · 129

Uniform solutions to SAT and Subset Sum by spiking neural P systems

2008 · Alberto Leporati, Giancarlo Mauri, et al. · Natural Computing · 118

Works count: 1,523

Citation count: 15,350