scientific article
From MaRDI portal
Publication:4010368
zbMath0752.03029MaRDI QIDQ4010368
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Second- and higher-order arithmetic and fragments (03F35)
Related Items (3)
Relating the bounded arithmetic and polynomial time hierarchies ⋮ Circuit lower bounds in bounded arithmetics ⋮ Unprovability of strong complexity lower bounds in bounded arithmetic
This page was built for publication: