With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets (Q4857596)
From MaRDI portal
scientific article; zbMATH DE number 821929
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets |
scientific article; zbMATH DE number 821929 |
Statements
With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets (English)
0 references
24 January 1996
0 references
polynomial time Turing reductions
0 references
