Citation
Abstract
This article is another in a series that attempts to define precisely and investigate the “computational complexity” of a general class of problems which includes many problems that occur in the DSN control center. Specific DSN control center questions that a theory of computational complexity will help define and answer include the problem of the optimum mix of core, disk, and drum storage in the control center, and the intelligent allocation of computational resources to flight projects of differing complexity in such a way that simultaneous real-time computing commitments can be made. This article shows that there exists such a theory which is capable of providing important information about the true complexity of several classes of non-trivial problems.
Details
- Volume
- V
- Published
- October 15, 1971
- Pages
- 91–98
- File Size
- 887.0 KB