On the complexity of interactive proofs with bounded communication (Q293359): Difference between revisions

@@ Property / author @@
+Johan T. Håstad
@@ Property / author: Johan T. Håstad / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+Uniform generation of NP-witnesses using an NP-oracle
+Normal rank
@@ Property / cites work @@
+Does co-NP have short interactive proofs ?
@@ Property / cites work: Does co-NP have short interactive proofs ? / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum disclosure proofs of knowledge
@@ Property / cites work: Minimum disclosure proofs of knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of interactive proof-systems
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank