AbstractWe consider the behavior of the error probability of a two-prover one-round interactive protocol repeated n times in parallel. We point out the connection of this problem with the density form of the Hales-Jewett theorem in Ramsey theory. This allows us to show that the error probability converges to 0 as n → ∞
We consider one-round games between a classical referee and two players. One of the main questions ...
This thesis contributes to the study of parallel repetition theorems and concentration bounds for no...
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An...
In many occasions, the knowledge error κ of an interactive proof is not small enough, and thus needs...
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) qu...
We consider a class of two-prover interactive proof systems where each prover returns a single bit t...
htmlabstractWe consider a class of two-prover interactive proof systems where each prover returns a...
We investigate the value of parallel repetition of one-round games with any number of players k>=2. ...
The behavior of games repeated in parallel, when played with quantumly entangled players, has receiv...
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An...
We consider a class of two-prover interactive proof sys-tems where each prover returns a single bit ...
A two-player one-round cooperative refereed game is a protocol in which a referee asks two randomly ...
We propose an analytical framework for studying parallel repetition, a basic product operation for o...
The parallel time of a population protocol is defined as the average number of required interactions...
htmlabstractWe consider the natural extension of two-player nonlocal games to an arbitrary number of...
We consider one-round games between a classical referee and two players. One of the main questions ...
This thesis contributes to the study of parallel repetition theorems and concentration bounds for no...
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An...
In many occasions, the knowledge error κ of an interactive proof is not small enough, and thus needs...
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) qu...
We consider a class of two-prover interactive proof systems where each prover returns a single bit t...
htmlabstractWe consider a class of two-prover interactive proof systems where each prover returns a...
We investigate the value of parallel repetition of one-round games with any number of players k>=2. ...
The behavior of games repeated in parallel, when played with quantumly entangled players, has receiv...
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An...
We consider a class of two-prover interactive proof sys-tems where each prover returns a single bit ...
A two-player one-round cooperative refereed game is a protocol in which a referee asks two randomly ...
We propose an analytical framework for studying parallel repetition, a basic product operation for o...
The parallel time of a population protocol is defined as the average number of required interactions...
htmlabstractWe consider the natural extension of two-player nonlocal games to an arbitrary number of...
We consider one-round games between a classical referee and two players. One of the main questions ...
This thesis contributes to the study of parallel repetition theorems and concentration bounds for no...
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An...
DOI
Add to ORKG