Exact complexity bounds for ordinal addition
type: Item
instance of: scholarly article
title: Exact complexity bounds for ordinal addition
zbMATH Open document ID: 0872.68118
DOI: 10.1016/0304-3975(95)00221-9
author: Françoise Maurin
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 983347
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00221-9
OpenAlex ID: W2048865589
cites work: The complexity of logical theories
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Q5525343
cites work: Q5608007
cites work: A uniform method for proving lower bounds on the computational complexity of logical theories
cites work: A Decision Procedure for the First Order Theory of Real Addition with Order
cites work: The first order properties of products of algebraic systems
cites work: Q4082296
cites work: Q3852172
cites work: Q4189277
cites work: The theory of integer multiplication with order restricted to primes is decidable
cites work: Q4090322
cites work: Q3346281
description: scientific article; zbMATH DE number 983347