The satisfiability problem for probabilistic ordered branching programs

DOI10.1007/S00224-001-1011-9MaRDI QIDQ5956791zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

satisfiability problem

Mathematics Subject Classification ID

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

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

Cited in

(5)

• scientific article; zbMATH DE number 1335882 (Why is no real title available?)
• Satisfiability algorithm for syntactic read-\(k\)-times branching programs
• scientific article; zbMATH DE number 7092118 (Why is no real title available?)
• 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)