Skip to search formSkip to main content

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

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

2010

2010

A new algorithm for solving maximum satisfiability (MAX-SAT) problems is introduced which clusters good solutions, and restarts… Expand

Is this relevant?

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… Expand

Is this relevant?

2007

2007

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

Is this relevant?

Highly Cited

2003

Highly Cited

2000

Highly Cited

2000

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

Is this relevant?

Highly Cited

1998

Highly Cited

1998

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

Is this relevant?

1998

1998

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

Is this relevant?

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… Expand

Is this relevant?

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… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

We construct multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error… Expand

Is this relevant?