RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2009 supplement № 1, Pages 91–93 (Mi pdm73)

Computational Methods in Discrete Mathematics

Transformation of CNF via resolution

I. G. Khnykin


Abstract: This paper describes a method for equivalent transformation of CNF associated with important problems of cryptographic analysis of asymmetric ciphers. The method can reduce amount of disjuncts and resolve some variables. It can be used as a CNF preprocessor to increase the efficiency of SAT solvers.

UDC: 519.7



© Steklov Math. Inst. of RAS, 2024