Complexity Theory of Real Functions 论文
1991Birkhäuser Boston eBooks引用 561
Computability, Logic, AI AlgorithmsAdvanced Algebra and LogicComplexity and Algorithms in Graphs
摘要
Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged as the new foundation of algorithms. On