scientific article; zbMATH DE number 65757

zbMATH Open0752.03029MaRDI QIDQ4010368FDOQ4010368

Authors: Pavel Pudlák 

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• scientific article; zbMATH DE number 65749
• A second order version of S₂ⁱ and U₂¹
• scientific article; zbMATH DE number 218509
• Delineating classes of computational complexity via second order theories with weak set existence principles. I

zbMATH Keywords

interactive computationsoptimal solutions to optimization problems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15) Second- and higher-order arithmetic and fragments (03F35)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Circuit lower bounds in bounded arithmetics
• Relating the bounded arithmetic and polynomial time hierarchies
• Unprovability of strong complexity lower bounds in bounded arithmetic

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 Q4010368)