Pages that link to "Item:Q674343"
From MaRDI portal
The following pages link to If NP has polynomial-size circuits, then MA=AM (Q674343):
Displaying 7 items.
- Arthur and Merlin as oracles (Q649095) (← links)
- \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) (← links)
- A note on the circuit complexity of PP (Q2576885) (← links)
- The Untold Story of $$\mathsf {SBP}$$ (Q5042261) (← links)
- NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES (Q5714674) (← links)