A nonasymptotic lower time bound for a strictly bounded second-order arithmetic (Q2498915)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A nonasymptotic lower time bound for a strictly bounded second-order arithmetic |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A nonasymptotic lower time bound for a strictly bounded second-order arithmetic |
scientific article |
Statements
A nonasymptotic lower time bound for a strictly bounded second-order arithmetic (English)
0 references
16 August 2006
0 references
complexity theory
0 references
lower bounds
0 references
weak arithmetics
0 references
random access machine
0 references
