Pages that link to "Item:Q2456368"
From MaRDI portal
The following pages link to Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368):
Displaying 5 items.
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- (Q5743381) (← links)