Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555)
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 6302133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect correspondences between dot-depth and polynomial-time hierarchies |
scientific article; zbMATH DE number 6302133 |
Statements
Perfect correspondences between dot-depth and polynomial-time hierarchies (English)
0 references
10 June 2014
0 references
computational complexity
0 references
leaf-languages
0 references
polynomial-time hierarchy
0 references
dot-depth hierarchy
0 references
0.9888083934783936
0 references
0.8514672517776489
0 references
0.8496779799461365
0 references
0.8293685913085938
0 references
