算法与编程基础 - 2026 进行中

科目: 算法与编程基础
级别: XII
类别: 大学生
测试题目: 英语
问题示例: A polynomial-time many-one reduction from decision problem A to decision problem B has been established. If A is NP-complete and B belongs to P, what follows? P equals co-NP, B is necessarily undecidable, P equals NP, A cannot be solved by a deterministic algorithm