On polynomial-time Turing and many-one completeness in PSPACE (Q1193869)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On polynomial-time Turing and many-one completeness in PSPACE |
scientific article; zbMATH DE number 65307
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On polynomial-time Turing and many-one completeness in PSPACE |
scientific article; zbMATH DE number 65307 |
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
