Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Probabilistic approach to the satisfiability problem

From MaRDI portal
Publication:808705
Jump to:navigation, search

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)


zbMATH Keywords

probabilistic algorithmssatisfiability problemNP problem


Mathematics Subject Classification ID

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

  • Counting the number of solutions for instances of satisfiability
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:808705&oldid=12749929"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki