Discrete Computation: Theory and Open Problems

Author(s)
Meyer, Albert R.
Thumbnail
DownloadMIT-LCS-TM-039.pdf (986.1Kb)
Metadata
Show full item record
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.
Date issued
1974-01
URI
https://hdl.handle.net/1721.1/148868
Series/Report no.
MIT-LCS-TM-039MAC-TM-039
Collections