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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
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
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
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
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
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
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
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
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
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
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?