Discrete Computation: Theory and Open Problems
| dc.contributor.author | Meyer, Albert R. | en_US |
| dc.date.accessioned | 2023-03-29T14:03:39Z | |
| dc.date.available | 2023-03-29T14:03:39Z | |
| dc.date.issued | 1974-01 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148868 | |
| dc.description.abstract | Complexity 1. Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. Aho, ed., Prentice-Hall, Englewood Cliff, N.J., 1973,pp.32-89. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-039 | |
| dc.relation.ispartofseries | MAC-TM-039 | |
| dc.title | Discrete Computation: Theory and Open Problems | en_US |
| dc.identifier.oclc | 09585291 |
