Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
From MaRDI portal
Publication:2339958
DOI10.1007/s00153-014-0414-7zbMath1371.03090arXiv1404.7435OpenAlexW2103436750MaRDI QIDQ2339958
Publication date: 14 April 2015
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.7435
Related Items
Iterated multiplication in \(VTC^0\) ⋮ Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts ⋮ Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strength of sharply bounded induction requires MSP
- On theories of bounded arithmetic for \(\mathrm{NC}^1\)
- Root finding with threshold circuits
- Independence results for variants of sharply bounded induction
- Parallel computation with threshold functions
- Circuits in bounded arithmetic. I
- Efficient threshold circuits for power series
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Threshold circuits of bounded depth
- On uniformity within \(NC^ 1\)
- Division in logspace-uniformNC1
- Constant Depth Reducibility
- The strength of sharply bounded induction
- Logarithmic Depth Circuits for Algebraic Functions
- Log Depth Circuits for Division and Related Problems
- Decomposition Problems for Modules Over Valuation Domains
- On Threshold Circuits and Polynomial Computation
- Expressibility and Parallel Complexity
- Theories for TC0 and Other Small Complexity Classes
- Notes on polynomially bounded arithmetic
- Valued Fields
- Algorithms in real algebraic geometry
This page was built for publication: Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
