Pages that link to "Item:Q1106840"

The following pages link to Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840):

Displaying 32 items.

• An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
• (Q5009546) (← links)
• The complexity of generating test instances (Q5048939) (← links)
• An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
• Probabilistic proof systems — A survey (Q5048957) (← links)
• Recent results in hardness of approximation (Q5054764) (← links)
• Geometry and Combinatorics via Right-Angled Artin Groups (Q5055451) (← links)
• Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
• Graph isomorphism is low for PP (Q5096798) (← links)
• On Emulating Interactive Proofs with Public Coins (Q5098777) (← links)
• (Q5121910) (← links)
• Worst-case to average case reductions for the distance to a code (Q5121912) (← links)
• Playing Savitch and Cooking Games (Q5187817) (← links)
• Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
• Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
• Approximate counting in bounded arithmetic (Q5422312) (← links)
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
• The Complexity of Zero Knowledge (Q5458822) (← links)
• Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
• Linear Logic Proof Games and Optimization (Q5689264) (← links)
• ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)
• NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES (Q5714674) (← links)
• New Computational Paradigms (Q5717081) (← links)
• Sumcheck-based delegation of quantum computing to rational server (Q5925559) (← links)
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
• Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
• Explainable arguments (Q6045191) (← links)
• (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
• A coercion-resistant blockchain-based E-voting protocol with receipts (Q6112251) (← links)
• Logspace verifiers, NC, and NP (Q6487945) (← links)
• Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)