An overview of computational complexity

@article{Cook1983AnOO,
  title={An overview of computational complexity},
  author={Stephen A. Cook},
  journal={Commun. ACM},
  year={1983},
  volume={26},
  pages={400-408}
}
  • S. Cook
  • Published 1 June 1983
  • Computer Science
  • Commun. ACM
An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed. 
Mathematical foundations for algorithm analysis
A parallel algorithm for the monadic unification problem
The monadic unification problem is introduced. AnO(log2n) parallel algorithm to solve this problem is given and shown to be correct.
Computing in Combinatorial Optimization
  • W. Cook
  • Computer Science
    Computing and Software Science
  • 2019
TLDR
A tour of research in combinatorial optimization is given, focusing on the early development of the subject and the central role played by linear programming.
Algorithm - Some Theory†
The term algorithm is generally used to describe a series of logical steps that, when implemented within a computer program, will perform a desired computational task. The task must be defined
A Monte Carlo Algorithm for the Satisfiability Problem
TLDR
Another Monte Carlo algorithm following from an original algorithm [4] is proposed and the average performance of the algorithm is polynomial and the probability that the algorithm fails to yield a correct answer for some data is less than e.g. less than 1%.
Juris Hartmanis: the beginnings of computational complexity
  • R. Stearns
  • Physics
    [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
The author discusses the early period of Hartmanis' research. He examines the origins of the concepts presented in the early papers and the influence of and effects on other research. Some of the
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
TLDR
It is shown that foqur complete problems for P (nonsparse versions of unification, path system accessibility, monotone circuit value, and ordered depth-first search) are parallelizable.
Complexity of computer algorithms
TLDR
This paper will concentrate on a few algorithms indicating some current problems and directions in computer science and related problems in mathematics, and is not the intention to provide a complete description of current work on complexity theory.
Classifying the computational complexity of problems
TLDR
A branch of computational complexity theory is described which attempts to expose more structure within the decidable side of the boundary by placing upper bounds on the amounts of computational resources which are needed to solve the problem.
The Computational Complexity Column
This is a survey about the title question, written for people who (like the author) see logic as forbidding, esoteric, and remote from their usual concerns. Beginning with a crash course on
...
...

References

SHOWING 1-10 OF 176 REFERENCES
The Complexity of Computing the Permanent
  • L. Valiant
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1979
The computational complexity of logical theories
and background.- Ehrenfeucht games and decision procedures.- Integer addition - An example of an Ehrenfeucht game decision procedure.- Some additional upper bounds.- Direct products of theories.-
Hierarchies of memory limited computations
This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of
The complexity of decision problems in automata theory and logic.
TLDR
This paper is intended to demonstrate the efforts of the Massachusetts Institute of Technology’s graduate students to improve the quality of their teaching and research.
The Complexity of Enumeration and Reliability Problems
  • L. Valiant
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1979
TLDR
For a large number of natural counting problems for which there was no previous indication of intractability, that they belong to the class of computationally eqivalent counting problems that are at least as difficult as the NP-complete problems.
Fast Parallel Computation of Polynomials Using Few Processors
TLDR
It is shown that any multivariate polynomial of degree d that can be compute sequentially in C steps can be computed in parallel in O(1) using only $(Cd)^{O(1)} processors.
Fast Parallel Computation of Polynomials Using Few Processes
It is shown that any multivariate polynomial that can be computed sequentially in C steps and has degree d can be computed in parallel in 0((log d) (log C + log d)) steps using only (Cd)0(1)
The computational complexity of algebraic and numeric problems
Thank you for downloading the computational complexity of algebraic and numeric problems elsevier computer science library theory of computation series 1. As you may know, people have search numerous
On the asymptotic complexity of matrix multiplication
  • D. Coppersmith, S. Winograd
  • Computer Science, Mathematics
    22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
  • 1981
TLDR
A consequence of these results is that ω, the exponent for matrix multiplication, is a limit point, that is, cannot be realized by any single algorithm.
...
...