Solving a binary puzzle

DOI10.1007/s11786-017-0322-4zbMath1382.05012OpenAlexW2612807407WikidataQ59517769 ScholiaQ59517769MaRDI QIDQ1701670

Rusydi H. Makarim, Putranto H. Utomo

Publication date: 27 February 2018

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-017-0322-4

zbMATH Keywords

puzzleGröbner basisNP-completenessSAT problem

Mathematics Subject Classification ID

Related Items (1)

Solving a binary puzzle

Uses Software

• Magma
• SageMath
• CryptoMiniSat
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• The Magma algebra system. I: The user language
• Solving a binary puzzle
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Gröbner Basis Representations of Sudoku
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• Planar Formulae and Their Uses
• Ideals, Varieties, and Algorithms

This page was built for publication: Solving a binary puzzle