The computational power of bounded arithmetic from the predicative viewpoint

MaRDI QIDQ5384976zbMATH OpenFDO

Authors Samuel R. Buss

Publication date 29 April 2008

Mathematics Subject Classification ID

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

Recommendations

• New Computational Paradigms
• scientific article; zbMATH DE number 440477
• Publication:3487327
• Structure and definability in general bounded arithmetic theories
• Bounded theories for polyspace computability

Cited in

(4)

• Bounded arithmetic for NC, ALogTIME, L and NL
• scientific article; zbMATH DE number 3995646 (Why is no real title available?)
• Third-Order Computation and Bounded Arithmetic
• New Computational Paradigms

This page was built for publication: The computational power of bounded arithmetic from the predicative viewpoint

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