Pages that link to "Item:Q4420841"
From MaRDI portal
The following pages link to Improving the variable ordering of OBDDs is NP-complete (Q4420841):
Displayed 39 items.
- Augmenting measure sensitivity to detect essential, dispensable and highly incompatible features in mass customization (Q320841) (← links)
- Characteristics of the maximal independent set ZDD (Q405673) (← links)
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- String-matching with OBDDs (Q596086) (← links)
- On the effect of local changes in the variable ordering of ordered decision diagrams (Q671612) (← links)
- On reachability and controllability of switched Boolean control networks (Q694840) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs (Q894703) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints (Q968351) (← links)
- On threshold BDDs and the optimal variable ordering problem (Q1016038) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- Weighted positive binary decision diagrams for exact probabilistic inference (Q1678452) (← links)
- Hardness of indentifying the minimum ordered binary decision diagram (Q1841888) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools (Q2352775) (← links)
- Symbolic graphs: Linear solutions to connectivity related problems (Q2471809) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams (Q2818019) (← links)
- On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking (Q2891405) (← links)
- Algebraic Attacks Using Binary Decision Diagrams (Q2947100) (← links)
- Optimization Bounds from Binary Decision Diagrams (Q2962554) (← links)
- Hierarchical Set Decision Diagrams and Automatic Saturation (Q3510869) (← links)
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem (Q3599068) (← links)
- Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram (Q3628611) (← links)
- An efficient relational deductive system for propositional non-classical logics (Q3647245) (← links)
- On the Influence of the State Encoding on OBDD-Representations of Finite State Machines (Q4256140) (← links)
- (Q4487092) (← links)
- FINDING SMALL EQUIVALENT DECISION TREES IS HARD (Q5249043) (← links)
- The Decomposition Tree for analyses of Boolean functions (Q5458074) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)