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

DOI10.26516/1997-7670.2019.28.3MaRDI QIDQ2272883zbMATH OpenOpenAlexWikidataFDO

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

Publication date 17 September 2019

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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)

Recommendations

• On the computational complexity of problems related to distinguishability sets
• On the computational complexity of problems related to distinguishability sets
• On the Classification of Deterministic Objects via Set Agreement Power
• An Application of Set Theory to Coding Theory
• A universal characterisation of codescent objects
• Coding in the partial order of enumerable sets
• Distinguishing conjunctive and disjunctive reducibilities by sparse sets
• Coding and definability in computable structures
• An application of difference sets to a problem concerning graphical codes

Cites work

• scientific article; zbMATH DE number 4085569 (Why is no real title available?)
• scientific article; zbMATH DE number 3313427 (Why is no real title available?)
• A Census of Small Latin Hypercubes
• A SAT attack on the Erdős discrepancy conjecture
• Algebraic Cryptanalysis
• Applications of SAT Solvers to Cryptanalysis of Hash Functions
• Cardinality networks: a theoretical and empirical study
• Enumeration of MOLS of small order
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• Permanents of multidimensional matrices: properties and applications
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• The Search for a Finite Projective Plane of Order 10
• The complexity of theorem-proving procedures
• The intractability of resolution

Cited in

(1)

• On the Classification of Deterministic Objects via Set Agreement Power

Describes a project that uses

Uses Software

• YalSAT
• Lingeling
• Splatz
• Treengeling
• Plingeling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272883)