Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika, 2009, supplement № 1, Pages 91–93 (Mi pdm73)  
Computational Methods in Discrete Mathematics

Transformation of CNF via resolution

I. G. Khnykin
Full-text PDF (391 kB)
References:
PDF
HTML
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.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: I. G. Khnykin, “Transformation of CNF via resolution”, Prikl. Diskr. Mat., 2009, supplement № 1, 91–93
Citation in format AMSBIB
\Bibitem{Khn09}
\by I.~G.~Khnykin
\paper Transformation of CNF via resolution
\jour Prikl. Diskr. Mat.
\yr 2009
\pages 91--93
\issueinfo supplement № 1
\mathnet{http://mi.mathnet.ru/pdm73}
Linking options:
  • https://www.mathnet.ru/eng/pdm73
  • https://www.mathnet.ru/eng/pdm/y2009/i10/p91
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:253
    Full-text PDF :99
    References:39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024