兵团 发表于 2025-3-23 13:09:11

http://reply.papertrans.cn/89/8803/880249/880249_11.png

lavish 发表于 2025-3-23 14:01:32

http://reply.papertrans.cn/89/8803/880249/880249_12.png

破布 发表于 2025-3-23 18:50:42

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.

确定方向 发表于 2025-3-24 01:12:40

http://reply.papertrans.cn/89/8803/880249/880249_14.png

finale 发表于 2025-3-24 02:52:37

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

GOAD 发表于 2025-3-24 07:59:03

http://reply.papertrans.cn/89/8803/880249/880249_16.png

BILIO 发表于 2025-3-24 13:03:08

http://reply.papertrans.cn/89/8803/880249/880249_17.png

亲属 发表于 2025-3-24 16:39:01

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

兵团 发表于 2025-3-24 21:19:40

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

动机 发表于 2025-3-25 02:40:07

http://reply.papertrans.cn/89/8803/880249/880249_20.png
页: 1 [2] 3 4 5 6 7
查看完整版本: Titlebook: Structure in Complexity Theory; Proceedings of the C Alan L. Selman Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Arit