scientific article; zbMATH DE number 3353170

zbMath0222.94042MaRDI QIDQ5628016

No author found.

Publication date: 1959

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Related Items

Incorporating bounds from decision diagrams into integer programming ⋮ On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs ⋮ Information Acquisition Under Resource Limitations in a Noisy Environment ⋮ Graph Coloring Lower Bounds from Decision Diagrams ⋮ Formal verification of a Java component using the RESOLVE framework ⋮ BDD-Based Symbolic Model Checking ⋮ Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning ⋮ Skew Circuits of Small Width ⋮ String-matching with OBDDs ⋮ Skew circuits of small width ⋮ Algebraic Attacks Using Binary Decision Diagrams ⋮ Synthesis for testability: Binary Decision Diagrams ⋮ Lagrangian bounds from decision diagrams ⋮ The Probabilistic Description Logic ⋮ Characteristics of the maximal independent set ZDD ⋮ Compact representation of near-optimal integer programming solutions ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem ⋮ The \(Multi\)-SAT algorithm ⋮ Linear temporal logic symbolic model checking ⋮ BDDs -- design, analysis, complexity, and applications. ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ Algebraic decomposition of discrete functions ⋮ Length of polynomials over finite groups ⋮ On the size of binary decision diagrams representing Boolean functions ⋮ A novel graphical technique for combinational logic representation and optimization ⋮ Compact representations of all members of an independence system ⋮ Probabilistic verification of Boolean functions ⋮ An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems ⋮ Outer approximation for integer nonlinear programs via decision diagrams ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Non-clausal redundancy properties ⋮ On the Structure of Counterexamples to Symmetric Orderings for BDD's ⋮ Exact Multiple Sequence Alignment by Synchronized Decision Diagrams ⋮ An impossibility gap between width-4 and width-5 permutation branching programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reduction of OBDDs in linear time ⋮ Implementing Efficient All Solutions SAT Solvers ⋮ On the evolution of the worst-case OBDD size ⋮ On the error resilience of ordered binary decision diagrams ⋮ 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