Accepting networks of splicing processors

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:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 9
Cited 2

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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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
On the size complexity of hybrid networks of evolutionary processors

Theoretical Computer Science - Descriptional complexity of formal systems
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
Solving 3CNF-SAT and HPP in linear time using WWW

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Accepting networks of splicing processors: Complexity results

Theoretical Computer Science
Accepting Networks of Genetic Processors are computationally complete

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present linear time solutions to two NP-complete problems, namely SAT and the directed Hamiltonian Path Problem (HPP), based on accepting networks of splicing processors (ANSP) having all resources (size, number of rules and symbols) linearly bounded by the size of the given instance. The underlying structure of these ANSPs does not depend on the number of clauses, in the case of SAT, and the number of edges, in the case of HPP. Furthermore, the running time of the ANSP solving HPP does not depend on the number of edges of the given graph and this network provides all solutions, if any, of the given instance of HPP.