The following pages link to (Q4934627):
Displaying 14 items.
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams (Q531446) (← links)
- Data structures for symbolic multi-valued model-checking (Q862857) (← links)
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types (Q929967) (← links)
- Outlier detection using binary decision diagrams (Q1741310) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control (Q2231651) (← links)
- Symbolic graphs: Linear solutions to connectivity related problems (Q2471809) (← links)
- Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic (Q3003427) (← links)
- Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory (Q3524940) (← links)
- Rank-Based Symbolic Bisimulation (Q4916208) (← links)
- A New Algorithm for Partitioned Symbolic Reachability Analysis (Q4982091) (← links)
- Counterexample guided knowledge compilation for Boolean functional synthesis (Q6535639) (← links)
- Tractable representations for Boolean functional synthesis (Q6630716) (← links)
