Titlebook: Structure in Complexity Theory; Proceedings of the C Alan L. Selman Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Arit

兵团

lavish

破布

Isomorphisms and 1-L reductions,All sets complete for NP under 1-L reductions are complete under length-increasing, invertible, and “almost one-one” ≤. reductions. All sets complete for PSPACE under 1-L reductions are p-isomorphic.

确定方向

finale

Structure in Complexity Theory978-3-540-39825-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

GOAD

BILIO

亲属

With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy,

兵团

A note on one-way functions and polynomial time isomorphisms,

动机