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.

Highly Cited

2013

Highly Cited

2013

Probabilistically-Checkable Proofs (PCPs) form the algorithmic core that enables fast verification of long computations in many… Expand

Is this relevant?

2009

Highly Cited

2008

Highly Cited

2008

In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial… Expand

Is this relevant?

2004

2004

We investigate the question of when a verifier, with the aid of a proof, can reliably compute a function faster than it can… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

The purpose of this paper is to present a tentative conceptual framework for studies of vulnerability and adaptation to climate… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

jkatz s. olumbia.edu. Department of Computer S ien e, Columbia University. Work supported in part by a DoD NDSEG Fellowship. y lu… Expand

Is this relevant?

1998

1998

The error probability of Probabilistically Checkable Proof (PCP) systems can be made exponentially small in the number of queries… Expand

Is this relevant?

1997

1997

We construct PCPS with strong zero-knowledge properties. First, we construct polynomially bounded (in size) PCP’S for NP which… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

Efficient Probabilistically Checkable Proofs and Applications to Approximation M. BELLARE* S. GOLDWASSERt C. LUNDi A. RUSSELL$ We… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you… Expand

Is this relevant?