With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets (Q4857596): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539792237188 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010402642 / rank | |||
Normal rank | |||
Latest revision as of 09:13, 30 July 2024
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
