We strengthen the nondeterministic hierarchy theorem for non-deterministic polynomial time to show that the lower bound holds against sub-linear advice. More formally, we show that for any constants d and d' such that 1 <= d < d', and for any time-constru
展开▼
机译:我们针对非确定性多项式时间加强了非确定性层次定理,以表明下界抵制了次线性建议。更正式地说,我们表明对于任何常数d和d'使得1 <= d 展开▼