Observational complexity of character strings.
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1972. M.S.
Main Author: | Seiferas, Joel I |
---|---|
Other Authors: | John J. Donovan. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/51478 |
Similar Items
-
Nondeterministic Time and Space Complexity Classes
by: Seiferas, Joel Irvin
Published: (2023) -
Vibrating-string electromechanical filters
by: Logue, Stanley H
Published: (2017) -
Approximate string joins with abbreviations
by: Tao, Wenbo, Ph. D. Massachusetts Institute of Technology
Published: (2018) -
Algorithms for string and graph layout
by: Newman, Alantha.
Published: (2005) -
A fast algorithm for the string editing problem and decision graph complexity
by: Masek, William Joseph
Published: (2008)