6   Artículos

 
en línea
Tasniem Al-Yahya, Mohamed El Bachir Abdelkrim Menai and Hassan Mathkour    
Boolean structural measures were introduced to explain the high performance of conflict-driven clause-learning (CDCL) SAT solvers on industrial SAT instances. Those considered in this study include measures related to backbones and backdoors: backbone si... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Oleg Zaikin,Stepan Kochemazov     Pág. 5 - 10
Many state-of-the-art algorithms for solving Boolean satisfiability problem (SAT) are based on the CDCL algorithm. CDCL generates a lot of so-called conflict clauses that correspond to traversed branches of a tree of possible solutions. To maintain high ... ver más
Revista: International Journal of Open Information Technologies    Formato: Electrónico

 
en línea
Oleg Zaikin     Pág. 29 - 33
In this study, shrinking and self-shrinking keystream generators are analyzed. These generators can be used in stream ciphering. For each generator the following cryptanalysis problem was considered: given a known keystream fragment, find the correspondi... ver más
Revista: International Journal of Open Information Technologies    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »