A continuous-time MaxSAT solver with high analog performance

Many real-life optimization problems can be formulated in Boolean logic as MaxSAT, a class of problems where the task is finding Boolean assignments to variables satisfying the maximum number of logical constraints. Since MaxSAT is NP-hard, no algorithm is known to efficiently solve these problems....

Descripción completa

Detalles Bibliográficos
Autores principales: Molnár, Botond, Molnár, Ferenc, Varga, Melinda, Toroczkai, Zoltán, Ercsey-Ravasz, Mária
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2018
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6242876/
https://www.ncbi.nlm.nih.gov/pubmed/30451849
http://dx.doi.org/10.1038/s41467-018-07327-2

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6242876/
https://www.ncbi.nlm.nih.gov/pubmed/30451849
http://dx.doi.org/10.1038/s41467-018-07327-2

Ejemplares similares