scientific article; zbMATH DE number 3353170

zbMATH Open0222.94042MaRDI QIDQ5628016FDOQ5628016

Author name not available (Why is that?)

Publication date: 1959

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Cited In (47)

• Incorporating bounds from decision diagrams into integer programming
• Lagrangian bounds from decision diagrams
• Probabilistic verification of Boolean functions
• Synthesis for testability: Binary Decision Diagrams
• Formal verification of a Java component using the RESOLVE framework
• On the evolution of the worst-case OBDD size
• The Probabilistic Description Logic
• Characteristics of the maximal independent set ZDD
• On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
• 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
• Title not available (Why is that?)
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Semi-tensor product-based algebra-logic mixed representation and fault diagnosis for a class of gate networks
• Algebraic decomposition of discrete functions
• Compact representation of near-optimal integer programming solutions
• Outer approximation for integer nonlinear programs via decision diagrams
• Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
• On the error resilience of ordered binary decision diagrams
• String-matching with OBDDs
• \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
• Information Acquisition Under Resource Limitations in a Noisy Environment
• Title not available (Why is that?)
• 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
• BDD-Based Symbolic Model Checking
• Graph Coloring Lower Bounds from Decision Diagrams
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
• Non-clausal redundancy properties
• Skew circuits of small width
• An impossibility gap between width-4 and width-5 permutation branching programs
• Algebraic Attacks Using Binary Decision Diagrams
• On the structure of counterexamples to symmetric orderings for BDD's
• Implementing Efficient All Solutions SAT Solvers
• Length of polynomials over finite groups
• Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning
• Skew Circuits of Small Width
• Target Cuts from Relaxed Decision Diagrams
• 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)