The following pages link to (Q3166192):
Displaying 13 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5092454) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- (Q6176153) (← links)
- The NISQ complexity of collision finding (Q6637517) (← links)
