Q5121910 (Q5121910): Difference between revisions

@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Q4230321
@@ Property / cites work: Q4230321 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+Zero-Knowledge Proofs of Proximity
@@ Property / cites work: Zero-Knowledge Proofs of Proximity / rank @@
+Normal rank
@@ Property / cites work @@
+Non-interactive delegation and batch NP verification from standard computational assumptions
+Normal rank
@@ Property / cites work @@
+Proofs of Proximity for Distribution Testing
@@ Property / cites work: Proofs of Proximity for Distribution Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximate probabilistically checkable proofs
+Normal rank
@@ Property / cites work @@
+Interactive proofs and the hardness of approximating cliques
+Normal rank
@@ Property / cites work @@
+Partial tests, universal tests and decomposability
+Normal rank
@@ Property / cites work @@
+Modern cryptography, probabilistic proofs and pseudo-randomness
+Normal rank
@@ Property / cites work @@
+Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
+Normal rank
@@ Property / cites work @@
+On the complexity of interactive proofs with bounded communication
+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 @@
+On interactive proofs with a laconic prover
@@ Property / cites work: On interactive proofs with a laconic prover / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549691
@@ Property / cites work: Q3549691 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Non-Interactive Proofs of Proximity
@@ Property / cites work: Non-Interactive Proofs of Proximity / rank @@
+Normal rank
@@ Property / cites work @@
+A Hierarchy Theorem for Interactive Proofs of Proximity
+Normal rank
@@ Property / cites work @@
+Probabilistically Checkable Arguments
@@ Property / cites work: Probabilistically Checkable Arguments / rank @@
+Normal rank
@@ Property / cites work @@
+Arguments of Proximity
@@ Property / cites work: Arguments of Proximity / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic methods for interactive proof systems
@@ Property / cites work: Algebraic methods for interactive proof systems / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-round interactive proofs for delegating computation
+Normal rank
@@ Property / cites work @@
+Interactive proofs of proximity
@@ Property / cites work: Interactive proofs of proximity / rank @@
+Normal rank
@@ Property / cites work @@
+IP = PSPACE
@@ Property / cites work: IP = PSPACE / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank