Solving 3CNF-SAT and HPP in linear time using WWW

Authors:
Florin Manea;Carlos Martín-Vide;Victor Mitrana
Affiliations:
Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania;Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania
Venue:
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Year:
2004

Citing 7
Cited 9

The connection machine

The connection machine
Towards a new architecture for symbolic processing

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Solving NP-Complete Problems With Networks of Evolutionary Processors

IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Hierarchies of memory limited computations

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Hybrid networks of evolutionary processors

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Accepting hybrid networks of evolutionary processors

DNA'04 Proceedings of the 10th international conference on DNA computing

Accepting networks of splicing processors: Complexity results

Theoretical Computer Science
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size

Information Processing Letters
On the size complexity of universal accepting hybrid networks of evolutionary processors

Mathematical Structures in Computer Science
On the recognition of context-free languages using accepting hybrid networks of evolutionary processors

International Journal of Computer Mathematics
jNEPView: A Graphical Trace Viewer for the Simulations of NEPs

IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
A Universal Accepting Hybrid Network of Evolutionary Processors

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards the automatic programming of NEPs

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
Timed accepting hybrid networks of evolutionary processors

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Accepting networks of splicing processors

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms

Quantified Score

Hi-index	0.00

Visualization

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.