Polynomial Running Times for Polynomial-Time Oracle Machines (Q5111319)
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: Polynomial Running Times for Polynomial-Time Oracle Machines |
scientific article; zbMATH DE number 7204442
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial Running Times for Polynomial-Time Oracle Machines |
scientific article; zbMATH DE number 7204442 |
Statements
26 May 2020
0 references
second-order complexity
0 references
oracle Turing machine
0 references
computable analysis
0 references
second-order polynomial
0 references
computational complexity of partial functionals
0 references
Polynomial Running Times for Polynomial-Time Oracle Machines (English)
0 references
0.8052835464477539
0 references
0.7983657121658325
0 references
0.7923150658607483
0 references
0.7823315262794495
0 references
