With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets (Q4857596)
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 821929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7824532389640808
0 references
0.7785384058952332
0 references
0.7766620516777039
0 references
0.7746914625167847
0 references
0.7693325877189636
0 references
