Physical manifestation of NP-completeness in analog computer devices
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Main Author: | Lee, Frank, 1975- |
---|---|
Other Authors: | Thomas F. Knight, Jr. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/80096 |
Similar Items
-
DNA Computing and Its Application on NP Completeness
Problem
by: Hasudungan, Rofilde, et al.
Published: (2013) -
Tatamibari is NP-complete
by: Adler, Aviv, et al.
Published: (2021) -
Zig-Zag Numberlink is NP-Complete
by: Adcock, Aaron, et al.
Published: (2015) -
Kaboozle Is NP-complete, even in a Strip
by: Asano, Tetsuo, et al.
Published: (2011) -
Solving the Rubik’s Cube optimally is NP-complete
by: Demaine, Erik D, et al.
Published: (2019)