scientific article; zbMATH DE number 922627

MaRDI QIDQ4893147zbMATH OpenFDO

Authors Jan Johannsen

Publication date 1 September 1996

zbMATH Keywords

bounded arithmetic theorycomputational complexity class

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• A note on sharply bounded arithmetic
• scientific article; zbMATH DE number 806747
• Bounded arithmetic for NC, ALogTIME, L and NL
• Theories for TC0 and Other Small Complexity Classes
• On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits

Cited in

(11)

• Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
• Theories for TC0 and Other Small Complexity Classes
• Circuits in bounded arithmetic. I
• On Lower Bounds for Constant Width Arithmetic Circuits
• The counting hierarchy in binary notation
• A logical characterization of constant-depth circuits over the reals
• scientific article; zbMATH DE number 3995646 (Why is no real title available?)
• Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
• scientific article; zbMATH DE number 1420845 (Why is no real title available?)
• Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication
• A Remark on Independence Results for Sharply 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 Q4893147)