On the parameterized complexity of short computation and factorization (Q1387097)
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 1158103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of short computation and factorization |
scientific article; zbMATH DE number 1158103 |
Statements
On the parameterized complexity of short computation and factorization (English)
0 references
2 June 1998
0 references
parameterized computational complexity
0 references
parameterized computations of Turing machines
0 references
nondeterministic machine
0 references
derivations
0 references
factorizations
0 references
hardness
0 references
completeness
0 references
\(W\) hierarchy
0 references
0.7810512781143188
0 references
0.75898677110672
0 references
