COCO 1990 Annual IEEE Conference on Computational Complexity
 |  |
Wall of Fame | Most Viewed COCO-1990 Paper
COCO
1990
Springer
13 years 8 months ago
1990
Springer
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 106 | ||
| 2 | | 84 | ||
| 3 | | 84 | ||
| 4 | | 71 | ||
| 5 | | 50 |