Discrete Computation: Theory and Open Problems

Thumbnail Image
Download
Name

MIT-LCS-TM-039.pdf

Size

986.15 KB

Format

Adobe PDF

Checksum (MD5)

0fd7a4a10c66c495a123551537606386

Author(s)
Meyer, Albert R.
Date Issued
January 1974
Series/Report no.
MIT-LCS-TM-039
MAC-TM-039
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.