scientific article; zbMATH DE number 3353170
From MaRDI portal
Publication:5628016
Cited in
(51)- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Incorporating bounds from decision diagrams into integer programming
- Lagrangian bounds from decision diagrams
- Graph coloring lower bounds from decision diagrams
- Probabilistic verification of Boolean functions
- Formal verification of a Java component using the RESOLVE framework
- Synthesis for testability: Binary Decision Diagrams
- On the evolution of the worst-case OBDD size
- Characteristics of the maximal independent set ZDD
- Implementing efficient All solutions SAT solvers
- The Probabilistic Description Logic
- On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
- On the complexity of computing the shuffled inequality function in classical and quantum NOBDDs
- Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
- A review of decision diagrams in system reliability modeling and analysis
- Improving branch-and-bound using decision diagrams and reinforcement learning
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Graph coloring with decision diagrams
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- scientific article; zbMATH DE number 7300350 (Why is no real title available?)
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- Algebraic decomposition of discrete functions
- Semi-tensor product-based algebra-logic mixed representation and fault diagnosis for a class of gate networks
- Compact representation of near-optimal integer programming solutions
- Target cuts from relaxed decision diagrams
- Outer approximation for integer nonlinear programs via decision diagrams
- BDD-based symbolic model checking
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- On the error resilience of ordered binary decision diagrams
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- String-matching with OBDDs
- Reducing the computational effort of symbolic supervisor synthesis
- Information Acquisition Under Resource Limitations in a Noisy Environment
- scientific article; zbMATH DE number 7301717 (Why is no real title available?)
- Algebraic attacks using binary decision diagrams
- On the size of binary decision diagrams representing Boolean functions
- Reduction of OBDDs in linear time
- Linear temporal logic symbolic model checking
- The Multi-SAT algorithm
- Tractable representations for Boolean functional synthesis
- Skew circuits of small width
- Non-clausal redundancy properties
- Skew circuits of small width
- An impossibility gap between width-4 and width-5 permutation branching programs
- Length of polynomials over finite groups
- On the structure of counterexamples to symmetric orderings for BDD's
- Compact representations of all members of an independence system
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
- Forms of representation for simple games: sizes, conversions and equivalences
- A novel graphical technique for combinational logic representation and optimization
- BDDs -- design, analysis, complexity, and applications.
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 Q5628016)
