Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
2-SAT
Description:
A Boolean satisfiability problem in theoretical computer science in which each clause contains at most two literals.
Primary topic:
Advanced Graph Theory Research (28%)
Related topics:
Advanced Graph Theory Research (28%),
Constraint Satisfaction and Optimization (23%),
Complexity and Algorithms in Graphs (21%)
Wikidata ID:
wiki/Q4596967
OpenAlex ID:
keywords/2-sat
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
1998
·
Mihir Bellare
, Oded Goldreich
, et al.
·
SIAM Journal on Computing
·
530
On selecting a satisfying truth assignment
2002
·
C.H. Papadimitriou
·
Annual Symposium on Foundations of Computer Science
·
295
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
·
253
PDF
The scaling window of the 2‐SAT transition
2001
·
Béla Bollobás
, Christian Borgs
, et al.
·
Random Structures and Algorithms
·
244
PDF
On the possibility of faster SAT algorithms
2010
·
Mihai Pătraşcu
, Ryan Williams
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
233
Almost 2-SAT is fixed-parameter tractable
2009
·
Igor Razgon
, Barry O'Sullivan
·
Journal of Computer and System Sciences
·
172
PDF
On the possibility of faster SAT algorithms
·
Mihai Patrascu
, Ryan Williams
·
164
A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart
2002
·
Schöning
·
Algorithmica
·
154
Which Phylogenetic Networks are Merely Trees with Additional Arcs?
2015
·
Andrew R. Francis
, Mike Steel
·
Systematic Biology
·
138
$(2+\varepsilon)$-Sat Is NP-hard
2017
·
Per Austrin
, Venkatesan Guruswami
, et al.
·
SIAM Journal on Computing
·
102
Counting models for 2SAT and 3SAT formulae
2004
·
Vilhelm Dahllöf
, Peter Jonsson
, et al.
·
Theoretical Computer Science
·
101
PDF
Rigorous results for random (2+p)-SAT
2001
·
Dimitris Achlioptas
, Lefteris M. Kirousis
, et al.
·
Theoretical Computer Science
·
84
A SAT-based Framework for Efficient Constrained Clustering
2010
·
Ian Davidson
, S. S. Ravi
, et al.
·
SIAM International Conference on Data Mining
·
80
Finding almost-satisfying assignments
1998
·
Uri Zwick
·
ACM Symposium on Theory of Computing (STOC)
·
67
PDF
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
2008
·
Magnus Wahlström
·
Springer eBooks
·
64
A bounded approximation for the minimum cost 2-sat problem
1992
·
Dan Gusfield
, Leonard Pitt
·
Algorithmica
·
51
Sorting, linear time and the satisfiability problem
1996
·
Etienne Grandjean
·
Annals of Mathematics and Artificial Intelligence
·
49
Solving Nonograms by combining relaxations
2008
·
K.J. Batenburg
, W.A. Kosters
·
Pattern Recognition
·
48
Major 2 Satisfiability Logic in Discrete Hopfield Neural Network
2021
·
Alyaa Alway
, Nur Ezlin Zamri
, et al.
·
International Journal of Computer Mathematics
·
47
Vertex partitioning problems: characterization, complexity and algorithms on partial K-trees
1994
·
Jan Arne Telle
·
45
Exact Max-SAT solvers for over-constrained problems
2006
·
Josep Argelich
, Felip Manyà
·
Journal of Heuristics
·
44
The pure literal rule threshold and cores in random hypergraphs
2004
·
Michael Molloy
·
TSpace (University of Toronto)
·
44
PDF
On renamable Horn and generalized Horn functions
1990
·
Vijaya Chandru
, Collette R. Coullard
, et al.
·
Annals of Mathematics and Artificial Intelligence
·
41
A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
2014
·
Dario Tamascelli
, Luca Zanetti
·
Journal of Physics A Mathematical and Theoretical
·
40
PDF
On the concentration of the number of solutions of random satisfiability formulas
2013
·
Emmanuel Abbe
, Andrea Montanari
·
Random Structures and Algorithms
·
36
PDF
Show more works
View as search
Works count:
443
Citation count:
5,051
Year
Topic
Type