Pages that link to "Item:Q4302792"
From MaRDI portal
The following pages link to Algebraic methods for interactive proof systems (Q4302792):
Displaying 50 items.
- Sumcheck arguments and their applications (Q2120101) (← links)
- Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Efficient proof composition for verifiable computation (Q2167734) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants (Q2272599) (← links)
- Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
- On the probabilistic closure of the loose unambiguous hierarchy (Q2346573) (← 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)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- A note on the circuit complexity of PP (Q2576885) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Rational Sumchecks (Q2799100) (← links)
- Interactive Coding for Interactive Proofs (Q2799101) (← links)
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
- Input-oblivious proof systems and a uniform complexity perspective on P/poly (Q2828212) (← links)
- An Algebraic Proof of the Real Number PCP Theorem (Q2946376) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Randomness and Computation (Q3088199) (← links)
- Almost Transparent Short Proofs for NPℝ (Q3088268) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Some Results on Interactive Proofs for Real Computations (Q3195685) (← links)
- How to Verify a Quantum Computation (Q4568113) (← links)
- (Q4612482) (← links)
- Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- New collapse consequences of NP having small circuits (Q4645178) (← links)
- On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE (Q4852431) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Simple doubly-efficient interactive proof systems for locally-characterizable sets (Q4993281) (← links)
- Local decoding and testing of polynomials over grids (Q4993289) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- (Q5005126) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to QMA(2) (Q5005160) (← links)
- (Q5009546) (← links)
- An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- (Q5075766) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Relations and equivalences between circuit lower bounds and karp-lipton theorems (Q5091782) (← links)