Exact complexity bounds for ordinal addition
From MaRDI portal
Publication:671516
DOI10.1016/0304-3975(95)00221-9zbMath0872.68118OpenAlexW2048865589MaRDI QIDQ671516
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00221-9
Cites Work
- A uniform method for proving lower bounds on the computational complexity of logical theories
- The complexity of logical theories
- The first order properties of products of algebraic systems
- Weak Second‐Order Arithmetic and Finite Automata
- A Decision Procedure for the First Order Theory of Real Addition with Order
- The theory of integer multiplication with order restricted to primes is decidable
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Exact complexity bounds for ordinal addition
