Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1335882

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

zbMATH Open0935.68025MaRDI QIDQ4258573FDOQ4258573


Authors: Manindra Agrawal, Thomas Thierauf Edit this on Wikidata


Publication date: 13 September 1999



Title of this publication is not available (Why is that?)



Recommendations

  • The satisfiability problem for probabilistic ordered branching programs
  • Probabilistic approach to the satisfiability problem
  • A probabilistic study on the satisfiability problem
  • Probabilistic analysis of satisfiability algorithms
  • Probabilistic satisfiability and coherence checking through integer programming
  • Probabilistic satisfiability and coherence checking through integer programming
  • Probabilistic satisfiability
  • Probabilistic satisfiability
  • Theory and Applications of Satisfiability Testing


zbMATH Keywords

satisfiability problem


Mathematics Subject Classification ID



Cited In (3)

  • On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
  • The satisfiability problem for probabilistic ordered branching programs
  • Syntactic partial order compression for probabilistic reachability





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258573)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4258573&oldid=18159588"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 16:57. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki