算法与计算理论 / Algorithms and Computation Theory

计算复杂性理论

Computational complexity theory

计算复杂性理论（Computational complexity theory）是数学理论层中的真实知识点；参考资料将其年代记为1965 年。

Knowledge type: 数学理论
First proposed or discovered: 1965
Proposer: 历史记录与科学共同体
Creator: Polytech Tree dataset
Last updated: 2026-10-12 07:25:30

Sub-knowledge points

No connected node yet

Higher-order knowledge points

P versus NP Problem / 数学理论 Shor's algorithm / 数学理论 PCP theorem / 数学理论 FLP Impossibility Theorem / 数学理论 Probably Approximately Correct Learning Theory / 数学理论

Main parameters and performance indicators

重要度：1参考分类：算法与计算理论

Open problems

No unresolved problem recorded yet

Related literature

ranked by community stars

https://en.wikipedia.org/wiki/Computational_complexity_theoryOpen source

https://github.com/secwind7/polytech-treeOpen source

Related products and links

No item recorded yet

Creation and modification trail

0 records

Seed recordPolytech Tree dataset2026-09-23 08:49:22

This static seed node has no database modification event yet.

Node update feedback

review required