Recent topics on bounded arithmetic and complexity theory

zbMATH Open1284.03265MaRDI QIDQ3087409FDOQ3087409

Authors: Satoru Kuroda 

Publication date: 16 August 2011

Recommendations

• Logical foundations of proof complexity
• scientific article; zbMATH DE number 806753
• scientific article; zbMATH DE number 819737
• scientific article; zbMATH DE number 4059391
• scientific article; zbMATH DE number 218509

zbMATH Keywords

complexity classesbounded arithmetic

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) First-order arithmetic and fragments (03F30) Descriptive complexity and finite models (68Q19) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (2)

• Title not available (Why is that?)
• Bounded arithmetic, proof complexity and two papers of Parikh

This page was built for publication: Recent topics on bounded arithmetic and complexity theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087409)