| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 425 8 |
| Ultima descărcare din IBN: 2023-12-05 15:50 |
| Căutarea după subiecte similare conform CZU |
| 004+510+519.1 (1) |
| Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4156) |
| Considerații fundamentale și generale ale matematicii (37) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012LIU, Yezhou, NICOLESCU, Radu, SUN, Jing, HENDERSON, Alec. A Sublinear Sudoku Solution in cP Systems and its Formal Verification. In: Computer Science Journal of Moldova, 2021, nr. 1(85), pp. 3-28. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 1(85) / 2021 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004+510+519.1 | ||||||
| MSC 2010: 68Q07, 68N30. | ||||||
| Pag. 3-28 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Sudoku is known as a NP-complete combinatorial numberplacement puzzle. In this study, we propose the first cP system solution to generalised Sudoku puzzles with m×m cells grouped in m blocks. By using a fixed constant number of rules, our cP system can solve all Sudoku puzzles in sublinear steps. We evaluate the cP system and discuss its formal verification. |
||||||
| Cuvinte-cheie cP systems, P systems, Sudoku problem, NPcomplete problem, Formal verification |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Liu, Y.</dc:creator> <dc:creator>Nicolescu, R.</dc:creator> <dc:creator>Sun, J.</dc:creator> <dc:creator>Henderson, A.</dc:creator> <dc:date>2021-03-01</dc:date> <dc:description xml:lang='en'><p>Sudoku is known as a NP-complete combinatorial numberplacement puzzle. In this study, we propose the first cP system solution to generalised Sudoku puzzles with m×m cells grouped in m blocks. By using a fixed constant number of rules, our cP system can solve all Sudoku puzzles in sublinear steps. We evaluate the cP system and discuss its formal verification.</p></dc:description> <dc:source>Computer Science Journal of Moldova 85 (1) 3-28</dc:source> <dc:subject>cP systems</dc:subject> <dc:subject>P systems</dc:subject> <dc:subject>Sudoku problem</dc:subject> <dc:subject>NPcomplete problem</dc:subject> <dc:subject>Formal verification</dc:subject> <dc:title>A Sublinear Sudoku Solution in cP Systems and its Formal Verification</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
