Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
From MaRDI portal
(Redirected from Publication:974099)
Recommendations
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
- Uniform solutions to SAT and subset sum by spiking neural P systems
- Solving SUBSET SUM by spiking neural P systems with pre-computed resources
- Solving QSAT in sublinear depth
- Solving NP-complete problems by spiking neural P systems with budding rules
Cites work
- scientific article; zbMATH DE number 5129602 (Why is no real title available?)
- scientific article; zbMATH DE number 3917710 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Computing with membranes
- Membrane computing. An introduction.
- Small Semi-weakly Universal Turing Machines
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- Solving SUBSET SUM by spiking neural P systems with pre-computed resources
- Spiking neural P systems
- Spiking neural P systems with extended rules: universality and languages
- Two-Processor Scheduling with Start-Times and Deadlines
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
Cited in
(33)- Spiking Neural P Systems with Thresholds
- Computational completeness of spiking neural P systems with inhibitory rules for generating string languages
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- Matrix representation and simulation algorithm of spiking neural P systems with structural plasticity
- P systems attacking hard problems beyond NP: a survey
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
- Simple neural-like P systems for maximal independent set selection
- Universality of spiking neural P systems with polarizations working in sequential mode induced by maximum spike number
- Spiking neural P systems: main ideas and results
- Spiking neural P systems with rules on synapses
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- An error-tolerant serial binary full-adder via a spiking neural P system using HP/LP basic neurons
- An improved universal spiking neural P system with generalized use of rules
- P systems with evolutional symport and membrane creation rules solving QSAT
- Spiking neural P systems with a flat maximally parallel use of rules
- Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem
- Spiking neural P systems with rules on synapses and anti-spikes
- Selected Topics in Computational Complexity of Membrane Systems
- Turing universality of sequential spiking neural P systems with polarizations as number accepting devices
- Reversible spiking neural P systems
- On the power of families of recognizer spiking neural P systems
- Communication P systems on simplicial complexes with applications in cluster analysis
- A bibliometric analysis of membrane computing (1998--2019)
- Homogeneous spiking neural P systems with structural plasticity
- On string languages generated by sequential spiking neural P systems based on the number of spikes
- An improved dynamic membrane evolutionary algorithm for constrained engineering design problems
- Spiking neural P systems with polarizations and astrocytes
- Spiking neural P systems with a generalized use of rules
- The power of synchronizing rules in membrane computing
- On Some Classes of Sequential Spiking Neural P Systems
- Solving a PSPACE-complete problem with cP systems
- A linear time complexity of breadth-first search using P system with membrane division
- Homogeneous spiking neural P systems working in sequential mode induced by maximum spike number
This page was built for publication: Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974099)
