Computational Complexity

In theoretical computer science, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm.A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i.e., the amount of resources needed to solve them, such as time and storage. Other measures of complexity are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of computational complexity theory is to determine the practical limits on what computers can and cannot do. The P versus NP problem, one of the seven Millennium Prize Problems, is dedicated to the field of computational complexity.Closely related fields in theoretical computer science are analysis of algorithms and computability theory. A key distinction between analysis of algorithms and computational complexity theory is that the former is devoted to analyzing the amount of resources needed by a particular algorithm to solve a problem, whereas the latter asks a more general question about all possible algorithms that could be used to solve the same problem. More precisely, computational complexity theory tries to classify problems that can or cannot be solved with appropriately restricted resources. In turn, imposing restrictions on the available resources is what distinguishes computational complexity from computability theory: the latter theory asks what kinds of problems can, in principle, be solved algorithmically.

相关学科： Data Structures and AlgorithmsLogic in Computer ScienceDiscrete MathematicsFormal Languages and Automata TheorySymbolic ComputationComputational GeometryCombinatorial OptimizationComputer Science and Game TheoryInformation TheoryTraveling Salesman Problem

学科讨论

暂无讨论内容，你可以

学科管理组

暂无学科课代表，你可以申请成为课代表

重要学者

George M. Whitesides

239927 被引用，1602 篇论文

Herbert A. Simon

145136 被引用，873 篇论文

Yang Yang

143009 被引用，2784 篇论文

Alejandro A. Schäffer

86150 被引用，278 篇论文

Martin Head-Gordon

83116 被引用，602 篇论文

Daniel L. Schacter

81200 被引用，639 篇论文

Marco Dorigo

77887 被引用，710 篇论文

Michael Randolph Garey

72916 被引用，105 篇论文

David S. Johnson

68809 被引用，193 篇论文

William W. Cooper

67710 被引用，268 篇论文