A sublinear Sudoku solution in cP systems and its formal verification

zbMath1469.68047MaRDI QIDQ821319

Radu Nicolescu, Jing Sun, Yezhou Liu, Alec Henderson

Publication date: 20 September 2021

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

Full work available at URL: http://www.math.md/publications/csjm/issues/v29-n1/13260/

zbMATH Keywords

formal verificationNP-complete problemP-systemscP-systemsSudoku problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Orthogonal arrays, Latin squares, Room squares (05B15) Specification and verification (program logics, model checking, etc.) (68Q60) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Tissue P systems.
• Computing with membranes
• An introduction to \(\mathrm{cP}\) systems
• On the number of Sudoku squares
• Formal verification of cP systems using PAT3 and ProB
• Solving a PSPACE-complete problem with cP systems
• Solving Sudoku Puzzles with Rewriting Rules
• Sinkhorn Solves Sudoku
• The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
• Programming P Systems with Complex Objects

Related Items (2)

Formal verification of cP systems using Coq ⋮ Towards automated deduction in cP systems

Uses Software

• PAT
• P-Lingua

This page was built for publication: A sublinear Sudoku solution in cP systems and its formal verification