The satisfiability problem for probabilistic ordered branching programs

DOI10.1007/S00224-001-1011-9zbMATH Open1009.68054OpenAlexW3101224878MaRDI QIDQ5956791FDOQ5956791

Authors: Manindra Agrawal, Thomas Thierauf 

Publication date: 2 June 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-001-1011-9

Recommendations

• scientific article; zbMATH DE number 1335882
• Probabilistic satisfiability
• Satisfiability algorithm for syntactic read-\(k\)-times branching programs
• Satisfiability algorithm for syntactic read-\(k\)-times branching programs
• Generalized probabilistic satisfiability

zbMATH Keywords

satisfiability problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (5)

• Title not available (Why is that?)
• Satisfiability algorithm for syntactic read-\(k\)-times branching programs
• Title not available (Why is that?)
• Satisfiability algorithm for syntactic read-\(k\)-times branching programs
• Syntactic partial order compression for probabilistic reachability

This page was built for publication: The satisfiability problem for probabilistic ordered branching programs

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