The counting hierarchy in binary notation

DOI10.4171/PM/1832zbMath1163.68321MaRDI QIDQ1008842

Gilda Ferreira

Publication date: 30 March 2009

Published in: Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

Full work available at URL: http://www.ems-ph.org/journals/show_pdf.php?issn=0032-5155&vol=66&iss=1&rank=6

zbMATH Keywords

bounded arithmeticcomplexity theorycounting hierarchy

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) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Groundwork for weak analysis
• A feasible theory for analysis
• Counting as integration in feasible analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The counting hierarchy in binary notation