Time-free solution to SAT problem by tissue P systems
DOI10.1155/2017/1567378zbMath1426.68255OpenAlexW2589277181WikidataQ59147267 ScholiaQ59147267MaRDI QIDQ1992361
Guanghua Zhang, Yueguo Luo, Zhongyang Xiong
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/1567378
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (1)
Cites Work
- Computational efficiency and universality of timed P systems with active membranes
- Non-confluence in divisionless P systems with active membranes
- A uniform solution to SAT using membrane creation
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time
- Computational complexity of tissue-like P systems
- Computing with membranes
- On the power of membrane division in P systems
- Solving SAT by algorithm transform of Wu's method
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Tissue-like P systems with evolutional symport/antiport rules
- Cell communication in tissue \(P\) systems: universality results
- An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- A New Approach for Solving SAT by P Systems with Active Membranes
- Membrane Computing
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- A Computing Procedure for Quantification Theory
This page was built for publication: Time-free solution to SAT problem by tissue P systems
