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 the normal view instead:
scientific article; zbMATH DE number 65307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8066058158874512
0 references
0.7859469652175903
0 references
0.7850298881530762
0 references
0.7802433371543884
0 references
