New Collapse Consequences of NP Having Small Circuits
New Collapse Consequences of NP Having Small Circuits
复制标题
具有小电路的 NP 的新崩溃后果
DOI:
--
复制
发表时间:
1995
期刊:
影响因子:
--
通讯作者:
O. Watanabe
中科院分区:
文献类型:
--
作者:
J. Köbler;O. Watanabe
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-time hierarchy PH to ZPP(NP) under the assumption that NP has polynomial-size circuits. This improves on the well-known result of Karp, Lipton, and Sipser (1980) stating a collapse of PH to its second level σ 2 P under the same assumption. As a further consequence, we derive new collapse consequences under the assumption that complexity classes like UP, FewP, and C=P have polynomial-size circuits.