Abstract
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resources (size, number of rules and symbols) linearly bounded by the size of the given instance. Surprisingly enough, the time for solving HPP does not depend on the number of edges of the given graph. Finally, we discuss a possible real life implementation, not of biological inspiration as one may expect according to the roots of AHNEPs, but using the facilities of the World Wide Web.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Castellanos, J., Martin-Vide, C., Mitrana, V., Sempere, J.: Solving NP-complete problems with networks of evolutionary processors. In: Mira, J., Prieto, A.G. (eds.) IWANN 2001. LNCS, vol. 2084, pp. 621–628. Springer, Heidelberg (2001)
Castellanos, J., Martin-Vide, C., Mitrana, V., Sempere, J.: Networks of evolutionary processors. Acta Informatica 39, 517–529 (2003)
Castellanos, J., Leupold, P., Mitrana, V.: Descriptional and computational complexity aspects of hybrid networks of evolutionary processors. Theoretical Computer Science (in press)
Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Pǎun, G.: Grammar Systems. Gordon and Breach (1993)
Csuhaj-Varjú, E., Salomaa, A.: Networks of parallel language processors. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 299–318. Springer, Heidelberg (1997)
Csuhaj-Varjú, E., Salomaa, A.: Networks ofWatson-Crick D0L system. In: Ito, M., Imaoka, T. (eds.) Proc. International Conference Words, Languages & Combinatorics III, pp. 134–150. World Scientific, Singapore (2003)
Csuhaj-Varjú, E., Mitrana, V.: Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Informatica 36, 913–926 (2000)
Errico, L., Jesshope, C.: Towards a new architecture for symbolic processing. In: Plander, I. (ed.) Artificial Intelligence and Information-Control Systems of Robots 1994, pp. 31–40. World Sci. Publ., Singapore (1994)
Fahlman, S.E., Hinton, G.E., Seijnowski, T.J.: Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. In: Proc. AAAI National Conf. on AI, pp. 109–113. William Kaufman, Los Altos (1983)
Hartmanis, J., Lewis II, P.M., Stearns, R.E.: Hierarchies of memory limited computations. In: Proc. 6th Annual IEEE Symp. on Switching Circuit Theory and Logical Design, pp. 179–190 (1965)
Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117, 533–546 (1965)
Hillis, W.D.: The Connection Machine. MIT Press, Cambridge (1985)
Margenstern, M., Mitrana, V., Perez-Jimenez, M.: Accepting hybrid networks of evolutionary processors. Pre-proccedings of DNA 10, 107–117 (2004)
Martin-Vide, C., Mitrana, V., Perez-Jimenez, M., Sancho-Caparrini, F.: Hybrid networks of evolutionary processors. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 401–412. Springer, Heidelberg (2003)
Sankoff, D., et al.: Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89, 6575–6579 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manea, F., MartÃn-Vide, C., Mitrana, V. (2005). Solving 3CNF-SAT and HPP in Linear Time Using WWW. In: Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2004. Lecture Notes in Computer Science, vol 3354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31834-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-31834-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25261-0
Online ISBN: 978-3-540-31834-7
eBook Packages: Computer ScienceComputer Science (R0)