A carregar...
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...
Na minha lista:
| Publicado no: | Springerplus |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Springer International Publishing
2016
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4851680/ https://ncbi.nlm.nih.gov/pubmed/27190753 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s40064-016-2187-4 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|