Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions

In this paper we propose an approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can construct different partitionings, each of them is a...

Descripción completa

Detalles Bibliográficos
Autores principales: Semenov, Alexander, Zaikin, Oleg
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2016
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4851680/
https://www.ncbi.nlm.nih.gov/pubmed/27190753
http://dx.doi.org/10.1186/s40064-016-2187-4

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4851680/
https://www.ncbi.nlm.nih.gov/pubmed/27190753
http://dx.doi.org/10.1186/s40064-016-2187-4

Ejemplares similares