Probabilistic approach to the satisfiability problem
From MaRDI portal
Publication:808705
DOI10.1016/0304-3975(91)90316-TzbMath0732.68051MaRDI QIDQ808705
Olivier Dubois, Jacques Carlier
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
A kind of logical compilation for knowledge bases, A natural explanation for the minimum entropy production principle, Counting the number of solutions for instances of satisfiability
Cites Work