On Nondeterminism, Enumeration Reducibility and Polynomial Bounds (Q4351919)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1054284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Nondeterminism, Enumeration Reducibility and Polynomial Bounds |
scientific article; zbMATH DE number 1054284 |
Statements
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds (English)
0 references
1 October 1997
0 references
nondeterminism
0 references
relative computability
0 references
enumeration reducibility
0 references
enumeration degrees
0 references
polynomial time reducibility
0 references
polynomial time degree
0 references
polynomial enumeration
0 references
conjunctive reducibility
0 references
recursive sets
0 references
computable sets
0 references
minimal pairs
0 references
jump operator
0 references
0.9159025
0 references
0.90334034
0 references
0.89442456
0 references
0 references
0.8867879
0 references
