Pages that link to "Item:Q685437"
From MaRDI portal
The following pages link to Interactive proof systems and alternating time-space complexity (Q685437):
Displaying 10 items.
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- (Q4035675) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes (Q5047165) (← links)
- Constant-Round Interactive Proof Systems for AC0[2] and NC1 (Q5098783) (← links)
- Logspace verifiers, NC, and NP (Q6487945) (← links)