19 search results - page 3 / 4 » A Parallel Repetition Theorem for Any Interactive Argument |
FOCS
2008
IEEE
14 years 26 days ago
2008
IEEE
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)â...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
COCO
2007
Springer
14 years 17 days ago
2007
Springer
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
ARTS
1999
Springer
13 years 10 months ago
1999
Springer
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...
TAPSOFT
1997
Springer
13 years 10 months ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...