On the complexity of computation of rudimentary predicates (Q4809504)
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: On the complexity of computation of rudimentary predicates |
scientific article; zbMATH DE number 2095444
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computation of rudimentary predicates |
scientific article; zbMATH DE number 2095444 |
Statements
On the complexity of computation of rudimentary predicates (English)
0 references
30 August 2004
0 references
numerical predicates
0 references
alternating Turing machines
0 references
computational complexity
0 references
0.91799885
0 references
0 references
0 references
0.90299773
0 references
0.8911672
0 references
