Mostrar el registro sencillo del ítem
Ponencia
The P versus NP problem: Unconventional insights from Membrane Computing
dc.creator | Pérez Jiménez, Mario de Jesús | es |
dc.date.accessioned | 2021-12-10T10:40:33Z | |
dc.date.available | 2021-12-10T10:40:33Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Pérez Jiménez, M.d.J. (2013). The P versus NP problem: Unconventional insights from Membrane Computing. En ACMC 2013: The 2nd Asian Conference on Membrane Computing Chengdu, China: IMCS: International Membrane Computing Society. | |
dc.identifier.uri | https://hdl.handle.net/11441/128171 | |
dc.description.abstract | : The P ?=NP question is one of the outstanding open problems in theoretical computer science. The relevance of this question is not only the inherent pleasure of solving a mathematical problem, since an answer to it would provide information of high economical interest. On the one hand, a negative answer to this question would confirm that the majority of current cryptographic systems are secure from a practical point of view. On the other hand, a positive answer would not only show the uncertainty about the secureness of these systems, but also this kind of answer is expected to come together with a general procedure such that it will provide a deterministic algorithm solving any NP-complete problem in polynomial time. In this talk, new approaches/tools to attack the previous problem are given by using Membrane Computing, a branch of Natural Computing aiming to abstract computing models from the structure and functioning of the living cell as well as from the organization of cells in tissues, organs, and other higher order structures. The devices of this paradigm constitute models for distributed, parallel and non-deterministic computing. Specifically, different borderlines between efficiency and non-efficiency are shown in terms of syntactical ingredients of cell-like and tissue like membrane systems. Each of them provide appealing characterizations of the P̸=NP conjecture within the framework of this bioinspired and unconventional computing model. | es |
dc.format | application/pdf | es |
dc.format.extent | 95 | es |
dc.language.iso | eng | es |
dc.publisher | IMCS: International Membrane Computing Society | es |
dc.relation.ispartof | ACMC 2013: The 2nd Asian Conference on Membrane Computing (2013). | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | The P versus NP problem: Unconventional insights from Membrane Computing | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial | es |
dc.relation.publisherversion | http://imcs.org.cn/img/(ACMC-2013)%202th.pdf | es |
dc.contributor.group | Universidad de Sevilla. TIC193 : Computación Natural | es |
dc.eventtitle | ACMC 2013: The 2nd Asian Conference on Membrane Computing | es |
dc.eventinstitution | Chengdu, China | es |
dc.relation.publicationplace | Chengdu, China | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
complexity-MC-ACMC-2013.pdf | 2.152Mb | ![]() | Ver/ | |