All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

P colonies with agent division

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F22%3AA0000910" target="_blank" >RIV/47813059:19240/22:A0000910 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.sciencedirect.com/journal/information-sciences/vol/589/suppl/C" target="_blank" >https://www.sciencedirect.com/journal/information-sciences/vol/589/suppl/C</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ins.2021.12.094" target="_blank" >10.1016/j.ins.2021.12.094</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    P colonies with agent division

  • Original language description

    P colonies, a variant of membrane (P) systems, are simple cell-inspired multi-agent systems without an inner structure of agents. The agents consist of a single membrane with a fixed number of atomic objects inside. Yet, they have interesting computational properties thanks to the collaboration and coordination of agents. Certain types of P colonies have been previously shown to be computationally complete in the Turing sense. We introduce a new type of rules for P colonies, inspired by the process of cell fission (division). We show that these extended P colonies can deterministically solve the Problem 3-SAT in linear time with respect to the number of clauses of the formula, starting with three agents only. In turn, classes NP and co-NP are solvable in polynomial time by polynomially uniform families of these P colonies. Several open problems arise, among others the possibility of characterization of the borderline between P and NP by certain parameters of P colonies.

  • Czech name

    —

  • Czech description

    —

Classification

  • Type

    J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database

  • CEP classification

    —

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    —

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Information Sciences

  • ISSN

    0020-0255

  • e-ISSN

    —

  • Volume of the periodical

    589

  • Issue of the periodical within the volume

    April 2022

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    8

  • Pages from-to

    162-169

  • UT code for WoS article

    —

  • EID of the result in the Scopus database

    2-s2.0-85122240605