Publication:4010368

zbMath0752.03029MaRDI QIDQ4010368

Pavel Pudlák

Publication date: 27 September 1992

zbMATH Keywords

interactive computations; optimal solutions to optimization problems

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

03F30: First-order arithmetic and fragments

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03F35: Second- and higher-order arithmetic and fragments

Related Items

Circuit lower bounds in bounded arithmetics, Relating the bounded arithmetic and polynomial time hierarchies