<--- Back to Details
First PageDocument Content
Cryptography / Computational complexity theory / Complexity classes / Quantum complexity theory / IP / NP / Randomized algorithms / NEXPTIME / Commitment scheme / Soundness / XTR / PP
Date: 2013-10-07 12:12:36
Cryptography
Computational complexity theory
Complexity classes
Quantum complexity theory
IP
NP
Randomized algorithms
NEXPTIME
Commitment scheme
Soundness
XTR
PP

A note on efficient zero-knowledge (extended Joe NEC

Add to Reading List

Source URL: people.csail.mit.edu

Download Document from Source Website

File Size: 915,73 KB

Share Document on Facebook

Similar Documents

Complexity classes / PSPACE-complete / IP / Generalized geography / PSPACE / PP / ArthurMerlin protocol / Computational complexity theory / NP / P / NEXPTIME / Reduction

1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum

DocID: 1oKqW - View Document

NEXPTIME

Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Query Answering in the Description Logic S ⋆ Meghyn Bienvenu1 , Thomas Eiter2 , Carsten Lutz1 , 2 ˇ

DocID: 1kbPF - View Document

Complexity classes / NTIME / Circuit complexity / P / Bounded-error probabilistic polynomial / Cook–Levin theorem / Time hierarchy theorem / NEXPTIME / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams†

DocID: 18Jpc - View Document

NEXPTIME / IP / NP / Soundness / KeY / Logic programming / Interactive proof system / Zero-knowledge proof / Theoretical computer science / Applied mathematics / Complexity classes

Interactive proofs with competing teams of no-signaling provers

DocID: 13Xht - View Document

Quantum information science / Complexity classes / Interactive proof system / QMA / NEXPTIME / IP / Probabilistically checkable proof / Qubit / Quantum computer / Theoretical computer science / Applied mathematics / Computational complexity theory

A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract

DocID: 13PJR - View Document