Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect correspondences between dot-depth and polynomial-time hierarchies |
scientific article |
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
