-
Geschrieben am 25.1.2008
Abstract: We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probability 1 (i.e., for every choice of its random string). For strings not in the language, the verifier rejects every provided "proof" with probability at least 1/2. Our result builds upon and improves a...
-
Geschrieben am 28.11.2007
-
Geschrieben am 20.11.2007
-
Geschrieben am 20.11.2007
-
Geschrieben am 6.11.2007
Faszinierend!