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...

Full description

Bibliographic Details

Published in:	Scientific reports Vol. 10; no. 1; p. 19741
Main Authors:	Bearden, Sean R. B., Pei, Yan Ru, Di Ventra, Massimiliano
Format:	Journal Article
Language:	English
Published:	London Nature Publishing Group UK 12.11.2020 Nature Publishing Group
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!