Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space (Q3477959)
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 4147510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space |
scientific article; zbMATH DE number 4147510 |
Statements
Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space (English)
0 references
1990
0 references
computation by abstract devices
0 references
bounded-action devices
0 references
complexity classes
0 references
complexity measures
0 references
computations on discrete
0 references
structures
0 references
trade-offs
0 references
combinatorial algorithms
0 references
counting
0 references
problems
0 references
graph algorithms
0 references
cliques
0 references
lower bounds
0 references
nondeterminism
0 references
0.752258837223053
0 references
0.7515856027603149
0 references
0.7445075511932373
0 references
