Pages that link to "Item:Q4302792"
From MaRDI portal
The following pages link to Algebraic methods for interactive proof systems (Q4302792):
Displayed 50 items.
- Parallel approximation of min-max problems (Q354658) (← links)
- Refereed delegation of computation (Q385709) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- 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)
- Avoiding simplicity is complex (Q693072) (← links)
- Outsourcing computation: the minimal refereed mechanism (Q777972) (← 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)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- Non-interactive proofs of proximity (Q1745962) (← 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)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- Probabilistic verification of proofs in calculuses (Q1977920) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)