Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
2-CNF
Description:
A Boolean formula in conjunctive normal form whose clauses contain at most two literals, studied in computational logic.
Primary topic:
Advanced Graph Theory Research (46%)
Related topics:
Advanced Graph Theory Research (46%),
Complexity and Algorithms in Graphs (20%),
Constraint Satisfaction and Optimization (16%)
OpenAlex ID:
keywords/2-cnf
A Threshold for Unsatisfiability
1996
·
Andreas Goerdt
·
Journal of Computer and System Sciences
·
280
PDF
The Minimum Satisfiability Problem
1994
·
Rajeev Kohli
, Ramesh Krishnamurti
, et al.
·
SIAM Journal on Discrete Mathematics
·
145
Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
2004
·
Naomi Nishimura
, Prabhakar Ragde
, et al.
·
Theory and Applications of Satisfiability Testing
·
112
Approximation through multicommodity flow
2002
·
P. Klein
, A. Agrawal
, et al.
·
Annual Symposium on Foundations of Computer Science
·
99
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
2003
·
Jens Gramm
, Edward A. Hirsch
, et al.
·
Discrete Applied Mathematics
·
92
PDF
A threshold for unsatisfiability
1992
·
Andreas Goerdt
·
Lecture notes in computer science
·
73
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
1995
·
Philip Klein
, Satish Rao
, et al.
·
COMBINATORICA
·
51
On Learning Ring-Sum-Expansions
1992
·
Paul Fischer
, Hans-Ulrich Simon
·
SIAM Journal on Computing
·
48
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
2007
·
Martin Fürer
, Shiva Prasad Kasiviswanathan
·
Springer eBooks
·
33
A linear programming and rounding approach to max 2-SAT
1996
·
Joseph Cheriyan
, William Cunningham
, et al.
·
DIMACS series in discrete mathematics and theoretical computer science
·
28
Finding all solutions if you can find one
1992
·
Rina Dechter
, Alon Itai
·
eScholarship (California Digital Library)
·
27
PDF
Length of prime implicants and number of solutions of random CNF formulae
1999
·
Y. Boufkhad
, O. Dubois
·
Theoretical Computer Science
·
23
Computational Complexity of SAT, XSAT and NAE-SAT: For linear and mixed Horn CNF formulas
2011
·
Tatjana Schmidt
·
Kölner Universitäts PublikationsServer (Universität zu Köln)
·
19
О свойствах функций, представимых в виде 2-КНФ
2001
·
А В Тарасов
·
Дискретная математика
·
18
PDF
New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT
2000
·
Jens Gramm
, Edward Hirsch
, et al.
·
Electronic colloquium on computational complexity
·
18
A simple parallel algorithm for finding a satisfying truth assignment to a 2-cnf formula
1988
·
Stephen A. Cook
, Michael Luby
·
Information Processing Letters
·
17
A Lower Bound on CNF Encodings of the At-Most-One Constraint
2017
·
Petr Kučera
, Petr Savický
, et al.
·
Theoretical Computer Science
·
16
PDF
Satisfiable Formulas Closed Under Replacement
2001
·
Hans Kleine Büning
, Zhao Xishun
·
Electronic Notes in Discrete Mathematics
·
14
Subclasses of quantified boolean formulas
1991
·
Andreas Flögel
, Marek Karpinski
, et al.
·
Lecture notes in computer science
·
14
Satisfiability of mixed Horn formulas
2007
·
Stefan Porschen
, Ewald Speckenmeyer
·
Discrete Applied Mathematics
·
12
Computing minimal models, stable models and answer sets
2006
·
ZBIGNIEW LONC
, MIROSŁAW TRUSZCZYŃSKI
·
Theory and Practice of Logic Programming
·
11
PDF
A note on the computational complexity of the pure classical implication calculus
1989
·
Gunnar Stålmarck
·
Information Processing Letters
·
11
Algorithms for Variable-Weighted 2-SAT and Dual Problems
2007
·
Stefan Porschen
, Ewald Speckenmeyer
·
Springer eBooks
·
10
On the Boolean Connectivity Problem for Horn Relations
2007
·
Kazuhisa Makino
, Suguru Tamaki
, et al.
·
Springer eBooks
·
10
A Variant of the VC-Dimension with Applications to Depth-3 Circuits
2021
·
Frankl, Peter
, Gryaznov, Svyatoslav
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
9
PDF
Show more works
View as search
Works count:
96
Citation count:
1,340
Year
Topic
Type