| dc.contributor.author | Goodman, Leonard I. | en_US |
| dc.date.accessioned | 2023-03-29T14:01:36Z | |
| dc.date.available | 2023-03-29T14:01:36Z | |
| dc.date.issued | 1971-09 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148847 | |
| dc.description.abstract | A theory of complexity is developed for algorithms implemented in typical programming languages. The complexity of a measuring a specific type of complexity is a complexity measure -- some function of the amount of a particular resource used by a program in processing an input. Typical resources would be execution time, core, I/O devices, and channels | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-017 | |
| dc.relation.ispartofseries | MAC-TM-017 | |
| dc.title | Complexity Measures for Programming Languages | en_US |
| dc.identifier.oclc | 09589292 | |
