scientific article; zbMATH DE number 1962842
From MaRDI portal
Publication:4418679
Recommendations
Cited in
(8)- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
- Competing provers yield improved Karp-Lipton collapse results
- On zero error algorithms having oracle access to one query
- Relations and equivalences between circuit lower bounds and karp-lipton theorems
- A tight Karp-Lipton collapse result in bounded arithmetic
- New collapse consequences of NP having small circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418679)