Pages that link to "Item:Q1108004"
From MaRDI portal
The following pages link to Does co-NP have short interactive proofs ? (Q1108004):
Displaying 34 items.
- New invariants for the graph isomorphism problem (Q2373963) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- On zero error algorithms having oracle access to one query (Q2498984) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- Permutation Groups and the Graph Isomorphism Problem (Q2821703) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More) (Q3088174) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Zero-Knowledge Interactive Proof Systems for New Lattice Problems (Q3460104) (← links)
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects (Q3593087) (← links)
- Abstract Storage Devices (Q3599084) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Generalized lowness and highness and probabilistic complexity classes (Q4729352) (← links)
- On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE (Q4852431) (← links)
- The complexity of generating test instances (Q5048939) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- Graph isomorphism is low for PP (Q5096798) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier (Q5204303) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- Stathis Zachos at 70! (Q5283390) (← links)
- An approach to parallel algorithm design (Q5286057) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)
- Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5918355) (← links)
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes (Q6064047) (← links)
- The final nail in the coffin of statistically-secure obfuscator (Q6161431) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- Monomial isomorphism for tensors and applications to code equivalence problems (Q6564091) (← links)
