Abstract
The framework for research in the theory of complexity of computations is described, emphasizing the interrelation between seemingly diverse problems and methods. Illustrative examples of practical and theoretical significance are given. Directions for new research are discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 625-633 |
| Number of pages | 9 |
| Journal | Communications of the ACM |
| Volume | 20 |
| Issue number | 9 |
| DOIs | |
| State | Published - 1 Sep 1977 |
Keywords
- algebraic complexity
- complexity of computations
- intractable problems
- probabilistic algorithms
Fingerprint
Dive into the research topics of 'Complexity of Computations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver