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)

Semantic Scholar uses AI to extract papers important to this topic.

2005

2005

- Hans van Maaren, Linda van Norden
- SAT
- 2005

Recently the Mathematical Programming community showed a renewed interest in Hilbertâ€™s Positivstellensatz. The reason for this isâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- BÃ©la BollobÃ¡s, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David Bruce Wilson
- Random Struct. Algorithms
- 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

- Piotr Berman, Marek Karpinski
- Electronic Colloquium on Computational Complexity
- 1998

We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds forâ€¦Â (More)

Is this relevant?

1997

1997

- Chung Keung Poon, Binhai Zhu, Francis Y. L. Chin
- Symposium on Computational Geometry
- 1997

Map labeling is an important problem in Geographical Information Systems (GIS). This problem is well studied in the area ofâ€¦Â (More)

Is this relevant?

1996

1996

- Dimitris J. Kavvadias, Martha Sideri
- COCOON
- 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

- Michel X. Goemans, David P. Williamson
- J. ACM
- 1995

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problemsâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Uriel Feige, Michel Goemanst
- 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?

Highly Cited

1995

Highly Cited

1995

- Uriel Feige, Michel X. Goemans
- ISTCS
- 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

- TomÃ¡s Feder
- Algorithmica
- 1994

We present two algorithms for network flow on networks with infinite capacities and finite integer supplies and demands. Theâ€¦Â (More)

Is this relevant?

1990

1990

- Brigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
- Annals of Mathematics and Artificial Intelligence
- 1990

We deal with the followingon-line 2-satisfiability problemP(m, n): starting fromC(0)=true, consider a sequence ofm Booleanâ€¦Â (More)

Is this relevant?