Solving NP-complete problems with delayed signals: An overview of current research directions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5172 LNCS, Issue , 2008, Pages 115-127

  Oltean, Mihai ^a   Muntean, Oana ^a  

^a BABE BOLYAI UNIVERSITY   (Romania)

Author keywords

Delay lines; NP complete; Optical computing; Signal based computing; Unconventional computing

Indexed keywords

DELAY LINES; NP-COMPLETE; OPTICAL COMPUTING; SIGNAL-BASED COMPUTING; UNCONVENTIONAL COMPUTING;

HARDWARE; OPTICAL DATA PROCESSING; OPTICAL FILTERS; POLYNOMIALS; WAVES;

COMPUTER SCIENCE;

EID: 70349878788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85673-3_10     Document Type: Conference Paper

References (23)

1. Aaronson, S.: NP-complete problems and physical reality. ACM SIGACT News Complexity Theory Column, March. ECCC TR05-026, quant-ph/0502072 (2005)
2. Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021-1024 (1994)
3. Bajcsy, M., Zibrov, A.S., Lukin, M.D.: Stationary pulses of light in an atomic medium. Nature 426, 638-641 (2003)
4. Collings, N., Sumi, R., Weible, K.J., Acklin, B., Xue, W.: The use of optical hardware to find good solutions of the travelling salesman problem (TSP). In: Proc. SPIE, vol.1806, pp. 637-641 (1993)
5. Feynman, R.: Simulating physics with computers. International Journal of Theoretical Physics 21, 467 (1982)
6. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to NPCompleteness. Freeman & Co, San Francisco (1979)
7. Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem. Opt. Express 15, 10473-10482 (2007)
8. Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem: erratum. Opt. Express 15, 12627-12627 (2007)
9. Hartmanis, J.: On the weight of computations. Bulletin of the EATCS 55, 136-138 (1995)
10. Kieu, T.D.: Quantum algorithm for Hilbert's tenth problem. Intl. Journal of Theoretical Physics 42, 1461-1478 (2003)
11. Muntean, O.: Optical Solutions for NP-complete problems, graduation thesis, Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj- Napoca, Romania, defended 3rd of (July 2007)
12. Muntean, O., Oltean, M.: Using light for solving the unbounded subset-sum problem (submitted, 2008)
13. Muntean, O., Oltean, O.: Deciding whether a linear Diophantine equation has solutions by using a light-based device (submitted, 2008)
14. Oltean, M.: A light-based device for solving the Hamiltonian path problem. In: Calude, C., et al. (eds.) UC 2006. LNCS, vol.4135, pp. 217-227. Springer, Heidelberg (2006)
15. Oltean, M.: Solving the Hamiltonian path problem with a light-based computer. Natural Computing 7(1), 57-70 (2008)
16. Oltean, M., Muntean, O.: Solving the subset-sum problem with a light-based device. Natural Computing (in press, 2008)
17. Oltean, M., Muntean, O.: Exact Cover with light. New Generation Computing 26(4) (2008)
18. Paun, Gh.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108-143 (2000)
19. Paun, Gh.: P systems with active membranes: attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75-90 (2001)
20. Shaked, N.T., Messika, S., Dolev, S., Rosen, J.: Optical solution for bounded NP-complete problems. Applied Optics 46, 711-724 (2007)
21. Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Goldwasser, S. (ed.) Proc. 35nd Annual Symposium on Foundations of Computer Science, pp. 124-134. IEEE Computer Society Press, Los Alamitos (1994)
22. Vergis, A., Steiglitz, K., Dickinson, B.: The complexity of analog computation. Mathematics and Computers in Simulation 28, 91-113 (1986)
23. Delay line memory @ Wikipedia (accessed) (12.06.2008), http://en.wikipedia.org/wiki/Delay line memory