| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 435 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 (4161) |
| 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 |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Liu, Y.</creatorName> <affiliation>Universitatea din Auckland, Noua Zeelandă</affiliation> </creator> <creator> <creatorName>Nicolescu, R.</creatorName> <affiliation>Universitatea din Auckland, Noua Zeelandă</affiliation> </creator> <creator> <creatorName>Sun, J.</creatorName> <affiliation>Universitatea din Auckland, Noua Zeelandă</affiliation> </creator> <creator> <creatorName>Henderson, A.</creatorName> <affiliation>Universitatea din Auckland, Noua Zeelandă</affiliation> </creator> </creators> <titles> <title xml:lang='en'>A Sublinear Sudoku Solution in cP Systems and its Formal Verification</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2021</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier> <subjects> <subject>cP systems</subject> <subject>P systems</subject> <subject>Sudoku problem</subject> <subject>NPcomplete problem</subject> <subject>Formal verification</subject> <subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>004+510+519.1</subject> </subjects> <dates> <date dateType='Issued'>2021-03-01</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><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></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>
|
|
|
