On propositional coding techniques for the distinguishability of objects in finite sets

DOI10.26516/1997-7670.2019.28.3zbMath1425.94047OpenAlexW2952587057WikidataQ127646228 ScholiaQ127646228MaRDI QIDQ2272883

Evgeniya Gennad'evna Beleĭ, Aleksandr Anatol'evich Semënov

Publication date: 17 September 2019

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathizv.isu.ru/en/article/file?id=1294

zbMATH Keywords

Latin squaresBoolean satisfiability problem (SAT)propositional encoding

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15)

Uses Software

• Plingeling
• Treengeling
• Splatz
• Lingeling
• YalSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Cardinality networks: a theoretical and empirical study
• The intractability of resolution
• Enumeration of MOLS of small order
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Permanents of multidimensional matrices: Properties and applications
• A SAT Attack on the Erdős Discrepancy Conjecture
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• Algebraic Cryptanalysis
• A Census of Small Latin Hypercubes
• The Search for a Finite Projective Plane of Order 10
• The complexity of theorem-proving procedures
• Applications of SAT Solvers to Cryptanalysis of Hash Functions

This page was built for publication: On propositional coding techniques for the distinguishability of objects in finite sets