Pages that link to "Item:Q4302792"

The following pages link to Algebraic methods for interactive proof systems (Q4302792):

Displayed 39 items.

• The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) ‎ (← links)
• Locally random reductions: Improvements and applications (Q676825) ‎ (← links)
• Interactive proof systems and alternating time-space complexity (Q685437) ‎ (← links)
• Quantum information and the PCP theorem (Q835644) ‎ (← links)
• The ideal membership problem and polynomial identity testing (Q963063) ‎ (← links)
• An application of quantum finite automata to interactive proof systems (Q1015813) ‎ (← links)
• AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) ‎ (← links)
• The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) ‎ (← links)
• PSPACE is provable by two provers in one round (Q1318475) ‎ (← links)
• \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) ‎ (← links)
• Randomness in interactive proofs (Q1321030) ‎ (← links)
• The power of adaptiveness and additional queries in random-self- reductions (Q1332664) ‎ (← links)
• On the power of multi-prover interactive protocols (Q1341733) ‎ (← links)
• Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) ‎ (← links)
• Geometric sets of low information content (Q1351460) ‎ (← links)
• On the hardness of computing the permanent of random matrices (Q1355377) ‎ (← links)
• Fully parallelized multi-prover protocols for NEXP-time (Q1356878) ‎ (← links)
• A tight relationship between generic oracles and type-2 complexity theory (Q1369098) ‎ (← links)
• Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) ‎ (← links)
• Interactive and probabilistic proof-checking (Q1577488) ‎ (← links)
• Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) ‎ (← links)
• Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) ‎ (← links)
• Relativized worlds with an infinite hierarchy (Q1606916) ‎ (← links)
• Competing provers yield improved Karp-Lipton collapse results (Q1775885) ‎ (← links)
• Randomized proofs in arithmetic (Q1807460) ‎ (← links)
• PSPACE has constant-round quantum interactive proof systems (Q1870552) ‎ (← links)
• One complexity theorist's view of quantum computing (Q1870556) ‎ (← links)
• On relationships between statistical zero-knowledge proofs (Q1975967) ‎ (← links)
• Probabilistic verification of proofs in calculuses (Q1977920) ‎ (← links)
• Hausdorff dimension and oracle constructions (Q2369006) ‎ (← links)
• Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) ‎ (← links)
• On the power of quantum, one round, two prover interactive proof systems (Q2467210) ‎ (← links)
• A note on the circuit complexity of PP (Q2576885) ‎ (← links)
• On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE (Q4852431) ‎ (← links)
• The Monomial Ideal Membership Problem and Polynomial Identity Testing (Q5387813) ‎ (← links)
• The Complexity of Zero Knowledge (Q5458822) ‎ (← links)
• Enumerations of the Kolmogorov function (Q5480623) ‎ (← links)
• Linear Logic Proof Games and Optimization (Q5689264) ‎ (← links)
• ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) ‎ (← links)