Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2007

Highly Cited

2007

Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT…

Highly Cited

2007

Highly Cited

2007

Abstract.We consider the question of constructing cryptographic pseudorandom generators (PRGs) in NC0, namely ones in which each…

Highly Cited

2003

Highly Cited

2003

Highly Cited

2003

Highly Cited

2003

For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete…

2002

2002

Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at…

Highly Cited

2000

Highly Cited

2000

The (unweighted) Maximum Satisfiability problem (MaxSat) is: Given a Boolean formula in conjunctive normal form, find a truth…

Highly Cited

1998

Highly Cited

1998

This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the…

1998

1998

We study the efficient approximability of basic graph and logic problems in the literature when instances are specified…

Highly Cited

1996

Highly Cited

1996

Let Dist(f,g)=Pr/sub u/[f(u)/spl ne/g(u)] denote the relative distance between functions f,g mapping from a group G to a group H…

Highly Cited

1995

Highly Cited

1995

Let Dist(f,g)=Pr/sub u/ [f(u)/spl ne/g(u)] denote the relative distance between functions f,g mapping from a group G to a group H…