Add to ORKGThesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.Includes bibliographical references (leaves 70-73).by Venkatesan Guruswami.S.M
AbstractWe investigate the question of when a verifier, with the aid of a proof, can reliably comput...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.Includes bibliogr...
In formal proof checking environments such as Mizar it is not merely thevalidity of mathematical for...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1996.Includes bibliogr...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
The definition of the class NP [Coo71, Lev73] highlights the problem of verification of proofs as on...
AbstractThe notion of efficient proof-checking has always been central to complexity theory, and it ...
The error probability of Probabilistically Checkable Proof (PCP) systems can be made exponentially s...
] LUCA TREVISAN Abstract We study query-efficient Probabilistically Checkable Proofs (PCPs) and l...
We construct multi-prover proof systems for NP which use only a constant number of provers to simult...
Various types of probabilistic proof systems have played a central role in the development of comput...
Can a proof be checked without reading it? That certainly seems impossible, no matter how much revi...
The PCP theorem (Arora et. al., J. ACM 45(1,3)) says that every NP-proof can be encoded to another p...
This article extracts the elements of algebra that play a central role in the design of efficient pr...
AbstractWe investigate the question of when a verifier, with the aid of a proof, can reliably comput...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.Includes bibliogr...
In formal proof checking environments such as Mizar it is not merely thevalidity of mathematical for...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1996.Includes bibliogr...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
The definition of the class NP [Coo71, Lev73] highlights the problem of verification of proofs as on...
AbstractThe notion of efficient proof-checking has always been central to complexity theory, and it ...
The error probability of Probabilistically Checkable Proof (PCP) systems can be made exponentially s...
] LUCA TREVISAN Abstract We study query-efficient Probabilistically Checkable Proofs (PCPs) and l...
We construct multi-prover proof systems for NP which use only a constant number of provers to simult...
Various types of probabilistic proof systems have played a central role in the development of comput...
Can a proof be checked without reading it? That certainly seems impossible, no matter how much revi...
The PCP theorem (Arora et. al., J. ACM 45(1,3)) says that every NP-proof can be encoded to another p...
This article extracts the elements of algebra that play a central role in the design of efficient pr...
AbstractWe investigate the question of when a verifier, with the aid of a proof, can reliably comput...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.Includes bibliogr...
In formal proof checking environments such as Mizar it is not merely thevalidity of mathematical for...