Descriptor
| Algorithms | 1 |
| College Mathematics | 1 |
| Computation | 1 |
| Computer Oriented Programs | 1 |
| Computer Science | 1 |
| Higher Education | 1 |
| Mathematics Education | 1 |
| Problem Solving | 1 |
| Scientific Research | 1 |
Source
| Mosaic | 1 |
Author
| Alexander, George | 1 |
Publication Type
| Journal Articles | 1 |
| Reports - Descriptive | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Alexander, George – Mosaic, 1983
When problems defy solution, mathematicians can settle for "almost." This branch of mathematics (called computational complexity) encompasses both the number of parts involved in a problem and the intricacy of their interrelatedness. Current research in this area is discussed, considering various computer applications involved. (JN)
Descriptors: Algorithms, College Mathematics, Computation, Computer Oriented Programs
