Pages that link to "Item:Q1210334"
From MaRDI portal
The following pages link to Addendum to: Non-deterministic exponential time has two-prower interactive protocols (Q1210334):
Displaying 5 items.
- A note on enumerative counting (Q809598) (← links)
- Multi-oracle interactive protocols with constant space verifiers (Q1190986) (← links)
- Bounding queries in the analytic polynomial-time hierarchy (Q1274987) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)