|
Prikladnaya Diskretnaya Matematika, 2011, Number 1(11), Pages 96–115
(Mi pdm263)
|
|
|
|
This article is cited in 16 scientific papers (total in 16 papers)
Mathematical Foundations of Informatics and Programming
Technology for translating combinatorial problems into Boolean equations
I. V. Otpuschennikov, A. A. Semenov Institute of System Dynamics and Control Theory, Siberian Branch of the Russian Academy of Sciences, Irkutsk, Russia
Abstract:
The article is devoted to converting combinatorial problems into the problems of solving Boolean equations. Some theoretical results are presented as the basis of technology for propositional encoding of algorithms calculating discrete functions. Software system Transalg implementing the technology is described. Examples of using the Transalg for translating cryptoanalysis algorithms to SAT-problem are presented. The technics for translating 0-1-ILP optimization algorithms into SAT are considered too.
Keywords:
discrete functions, Boolean equations, cryptoanalysis, propositional encoding.
Citation:
I. V. Otpuschennikov, A. A. Semenov, “Technology for translating combinatorial problems into Boolean equations”, Prikl. Diskr. Mat., 2011, no. 1(11), 96–115
Linking options:
https://www.mathnet.ru/eng/pdm263 https://www.mathnet.ru/eng/pdm/y2011/i1/p96
|
Statistics & downloads: |
Abstract page: | 621 | Full-text PDF : | 279 | References: | 65 | First page: | 1 |
|