Characterizing polynomial complexity classes by reducibilities (Q3489449)
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: Characterizing polynomial complexity classes by reducibilities |
scientific article; zbMATH DE number 4162261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing polynomial complexity classes by reducibilities |
scientific article; zbMATH DE number 4162261 |
Statements
Characterizing polynomial complexity classes by reducibilities (English)
0 references
1990
0 references
structural complexity
0 references
characterizations
0 references
reducibility
0 references
classes \(\Sigma ^ P_ k\)
0 references
polynomial-time hierarchy
0 references
0 references
0.8060195446014404
0 references
0.7885950207710266
0 references
0.774770200252533
0 references
0.7731913924217224
0 references
