Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
![]() |
![]() ![]() |
![]() PAN, Linqiang, ALHAZOV, Artiom. Solving HPP and SAT by P systems with active membranes and separation rules. In: Acta Informatica, 2006, vol. 43, pp. 131-145. ISSN 0001-5903. DOI: https://doi.org/10.1007/s00236-006-0018-8 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Acta Informatica | ||||||
Volumul 43 / 2006 / ISSN 0001-5903 /ISSNe 1432-0525 | ||||||
|
||||||
DOI:https://doi.org/10.1007/s00236-006-0018-8 | ||||||
Pag. 131-145 | ||||||
|
||||||
![]() |
||||||
Rezumat | ||||||
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obtaining an exponential working space in a linear time, and on this basis solving hard problems, typically NP-complete problems, in polynomial (often, linear) time. In this paper, using another way to obtain exponential working space - membrane separation, it was shown that Satisfiability Problem and Hamiltonian Path Problem can be deterministically solved in linear or polynomial time by a uniform family of P systems with separation rules, where separation rules are not changing labels, but polarizations are used. Some related open problems are mentioned. |
||||||
Cuvinte-cheie Distributed parallel computing, Hamiltonian path problems, Hard problems, Membrane separation, Membrane system, P systems with active membranes, Polynomial-time, Satisfiability problems |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-198334</cfResPublId> <cfResPublDate>2006-08-01</cfResPublDate> <cfStartPage>131</cfStartPage> <cfISSN>0001-5903</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/198334</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Solving HPP and SAT by P systems with active membranes and separation rules</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Distributed parallel computing; Hamiltonian path problems; Hard problems; Membrane separation; Membrane system; P systems with active membranes; Polynomial-time; Satisfiability problems</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obtaining an exponential working space in a linear time, and on this basis solving hard problems, typically NP-complete problems, in polynomial (often, linear) time. In this paper, using another way to obtain exponential working space - membrane separation, it was shown that Satisfiability Problem and Hamiltonian Path Problem can be deterministically solved in linear or polynomial time by a uniform family of P systems with separation rules, where separation rules are not changing labels, but polarizations are used. Some related open problems are mentioned.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2006-08-01T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2006-08-01T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-64389</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2006-08-01T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-13033</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2006-08-01T24:00:00</cfStartDate> </cfPers_ResPubl> <cfFedId> <cfFedIdId>ibn-doi-198334</cfFedIdId> <cfFedId>10.1007/s00236-006-0018-8</cfFedId> <cfStartDate>2006-08-01T24:00:00</cfStartDate> <cfFedId_Class> <cfClassId>31d222b4-11e0-434b-b5ae-088119c51189</cfClassId> <cfClassSchemeId>bccb3266-689d-4740-a039-c96594b4d916</cfClassSchemeId> </cfFedId_Class> <cfFedId_Srv> <cfSrvId>5123451</cfSrvId> <cfClassId>eda2b2e2-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>5a270628-f593-4ff4-a44a-95660c76e182</cfClassSchemeId> </cfFedId_Srv> </cfFedId> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-64389</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-64389-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2006-08-01T24:00:00</cfStartDate> <cfFamilyNames>Pan</cfFamilyNames> <cfFirstNames>Linqiang</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-13033</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-13033-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2006-08-01T24:00:00</cfStartDate> <cfFamilyNames>Alhazov</cfFamilyNames> <cfFirstNames>Artiom</cfFirstNames> </cfPersName_Pers> </cfPers> <cfSrv> <cfSrvId>5123451</cfSrvId> <cfName cfLangCode='en' cfTrans='o'>CrossRef DOI prefix service</cfName> <cfDescr cfLangCode='en' cfTrans='o'>The service of issuing DOI prefixes to publishers</cfDescr> <cfKeyw cfLangCode='en' cfTrans='o'>persistent identifier; Digital Object Identifier</cfKeyw> </cfSrv> </CERIF>