Efficient solution of Boolean satisfiability problems with digital memcomputing

Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of the SAT problem, as it is known, require efficient solution methods in a variety of applications. It is the decision prob...

Celý popis

Podrobná bibliografia

Vydané v:	Scientific reports Ročník 10; číslo 1; s. 19741
Hlavní autori:	Bearden, Sean R. B., Pei, Yan Ru, Di Ventra, Massimiliano
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Nature Publishing Group UK 12.11.2020 Nature Publishing Group
Predmet:	639/166 639/925 Algorithms Boolean Differential equations Humanities and Social Sciences multidisciplinary Ordinary differential equations Physics Science Science (multidisciplinary)
ISSN:	2045-2322, 2045-2322
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!