FAQ

2-satisfiability

Known as: 2-SAT, MAX-2SAT, 2-CNF-SAT 
In computer science, 2-satisfiability is a computational problem of assigning values to variables, each of which has two possible values, in order to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2018
0102019852018

Related topics

Related topics

50 relations
Arc diagramAutomatic label placementBacktrackingBinary image
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
2-satisfiability
Pixel
Heuristic
Computational complexity theory
Graph automorphism
Computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Sums of Squares, Satisfiability and Maximum Satisfiability
Recently the Mathematical Programming community showed a renewed interest in Hilbert’s Positivstellensatz. The reason for this is… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The scaling window of the 2-SAT transition
We consider the random 2-satisfiability problem, in which each instance is a formula that is the conjunction of m clauses of the… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
On Some Tighter Inapproximability Results
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for… (More)
  • figure 1
  • figure 2
Is this relevant?
1997
1997
A Polynomial Time Solution for Labeling a Rectilinear Map
Map labeling is an important problem in Geographical Information Systems (GIS). This problem is well studied in the area of… (More)
  • figure 2
  • figure 1
Is this relevant?
1996
1996
The Inverse Satisfiability Problem
We study the complexity of telling whether a set of bit-vectors represents the set of all satisfying truth assignments of a… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… (More)
  • figure 1
  • figure 2
  • table I
  • table II
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Approximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT
It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this… (More)
  • table 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT
It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this… (More)
Is this relevant?
1994
1994
Network flow and 2-satisfiability
We present two algorithms for network flow on networks with infinite capacities and finite integer supplies and demands. The… (More)
  • figure 1
  • figure 2
Is this relevant?
1990
1990
On-line 2-satisfiability
We deal with the followingon-line 2-satisfiability problemP(m, n): starting fromC(0)=true, consider a sequence ofm Boolean… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?