中文

A Downward Collapse within the Polynomial Hierarchy

计算复杂性 2007-05-23 v1

摘要

Downward collapse (a.k.a. upward separation) refers to cases where the equality of two larger classes implies the equality of two smaller classes. We provide an unqualified downward collapse result completely within the polynomial hierarchy. In particular, we prove that, for k > 2, if \psigkone=\psigktwo\psigkone = \psigktwo then \sigmak=\pik=\ph\sigmak = \pik = \ph. We extend this to obtain a more general downward collapse result.

引用

@article{arxiv.cs/9910007,
  title  = {A Downward Collapse within the Polynomial Hierarchy},
  author = {Edith Hemaspaandra and Lane A. Hemaspaandra and Harald Hempel},
  journal= {arXiv preprint arXiv:cs/9910007},
  year   = {2007}
}

备注

14 pages