Pages that link to "Item:Q1982985"
From MaRDI portal
The following pages link to Solving a PSPACE-complete problem with cP systems (Q1982985):
Displaying 7 items.
- A sublinear Sudoku solution in cP systems and its formal verification (Q821319) (← links)
- Formal verification of cP systems using Coq (Q2152300) (← links)
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (Q2570127) (← links)
- Sublinear P system solutions to NP-complete problems (Q6038691) (← links)
- Neighbourhood message passing computation on a lattice with cP systems (Q6135714) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)
- Spiking neural P systems with polarizations and astrocytes (Q6177126) (← links)