loading
Documents

Research.Publish.Connect.

Paper

Authors: Victor Mitrana 1 ; Andrei Păun 2 and Mihaela Păun 3

Affiliations: 1 Department of Information Systems, Polytechnic University of Madrid, Crta. de Valencia km. 7 - 28031 Madrid, Spain, National Institute for Research and Development of Biological Sciences, Independentei Bd. 296, Bucharest and Romania ; 2 Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 010014 Bucharest and Romania ; 3 National Institute for Research and Development of Biological Sciences, Independentei Bd. 296, Bucharest and Romania

ISBN: 978-989-758-366-7

Keyword(s): Splicing, Accepting Splicing System, Computational Complexity, Descriptional Complexity, 3-colorability Problem.

Abstract: We define a variant of accepting splicing system that can be used as a problem solver. A condition for halting the computation on a given input as well as a condition for making a decision as soon as the computation has stopped is considered. An algorithm based on this accepting splicing system that solves a well-known NP-complete problem, namely the 3-colorability problem is presented. We discuss an efficient solution in terms of running time and additional resources (axioms, supplementary symbols, number of splicing rules. More precisely, for a given graph with n vertices and m edges, our solution runs in O(nm) time, and needs O(mn2) other resources. Two variants of this algorithm of a reduced time complexity at an exponential increase of the other resources are finally discussed.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.92.28.84

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Mitrana, V.; Păun, A. and Păun, M. (2019). How Complex is to Solve a Hard Problem with Accepting Splicing Systems.In Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk - Volume 1: COMPLEXIS, ISBN 978-989-758-366-7, pages 27-35. DOI: 10.5220/0007715900270035

@conference{complexis19,
author={Victor Mitrana. and Andrei Păun. and Mihaela Păun.},
title={How Complex is to Solve a Hard Problem with Accepting Splicing Systems},
booktitle={Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk - Volume 1: COMPLEXIS,},
year={2019},
pages={27-35},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007715900270035},
isbn={978-989-758-366-7},
}

TY - CONF

JO - Proceedings of the 4th International Conference on Complexity, Future Information Systems and Risk - Volume 1: COMPLEXIS,
TI - How Complex is to Solve a Hard Problem with Accepting Splicing Systems
SN - 978-989-758-366-7
AU - Mitrana, V.
AU - Păun, A.
AU - Păun, M.
PY - 2019
SP - 27
EP - 35
DO - 10.5220/0007715900270035

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.