Pages that link to "Item:Q685724"
From MaRDI portal
The following pages link to Non-deterministic exponential time has two-prover interactive protocols (Q685724):
Displayed 41 items.
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- On being incoherent without being very hard (Q1198954) (← links)
- The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- On proving that a graph has no large clique: A connection with Ramsey theory (Q1351164) (← links)
- Fully parallelized multi-prover protocols for NEXP-time (Q1356878) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
- Spot-checkers (Q1577018) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- Fast approximate PCPs for multidimensional bin-packing problems (Q1767978) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- Algebraic testing and weight distributions of codes. (Q1874387) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- Probabilistic verification of proofs in calculuses (Q1977920) (← 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)
- What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2) (Q3541815) (← links)
- Local Expansion of Symmetrical Graphs (Q4291181) (← links)
- RECYCLING RANDOM BITS IN PARALLEL (Q4820146) (← links)
- On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE (Q4852431) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)