scientific article
From MaRDI portal
Publication:2904790
DOI10.4230/LIPIcs.STACS.2012.519zbMath1245.68088MaRDI QIDQ2904790
Rahul Santhanam, Maurice Jansen
Publication date: 23 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant ⋮ Natural Proofs versus Derandomization ⋮ Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
This page was built for publication:
