On polynomial-time Turing and many-one completeness in PSPACE (Q1193869): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:45, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On polynomial-time Turing and many-one completeness in PSPACE |
scientific article |
Statements
On polynomial-time Turing and many-one completeness in PSPACE (English)
0 references
27 September 1992
0 references
reducibilities
0 references
PSPACE-complete sets
0 references
