Pages that link to "Item:Q4485697"
From MaRDI portal
The following pages link to Branching Programs and Binary Decision Diagrams (Q4485697):
Displaying 50 items.
- \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems (Q262437) (← links)
- Investigating dynamic causalities in reaction systems (Q264548) (← links)
- On the read-once property of branching programs and CNFs of bounded treewidth (Q309788) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- On the OBDD representation of some graph classes (Q317396) (← links)
- Extension of the hierarchy for \(k\)-OBDDs of small width (Q353910) (← links)
- Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Implicit computation of maximum bipartite matchings by sublinear functional operations (Q477185) (← links)
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- Dualization of Boolean functions using ternary decision diagrams (Q513353) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams (Q531446) (← links)
- Symbolic approximate time-optimal control (Q533800) (← links)
- Larger lower bounds on the OBDD complexity of integer multiplication (Q553298) (← links)
- Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications (Q600975) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- De Bruijn sequences and complexity of symmetric functions (Q662186) (← links)
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- On the contribution of backward jumps to instruction sequence expressiveness (Q692892) (← links)
- An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order (Q708357) (← links)
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
- Width hierarchy for \(k\)-OBDD of small width (Q748240) (← links)
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- A note on the decoding complexity of error-correcting codes (Q845843) (← links)
- Lower bounds on the OBDD size of two fundamental functions' graphs (Q845898) (← links)
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- Data structures for symbolic multi-valued model-checking (Q862857) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414) (← links)
- Incremental branching programs (Q929291) (← links)
- The optimal read-once branching program complexity for the direct storage access function (Q963361) (← links)
- A nondeterministic space-time tradeoff for linear codes (Q976097) (← links)
- A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- On threshold BDDs and the optimal variable ordering problem (Q1016038) (← links)
- On the P versus NP intersected with co-NP question in communication complexity (Q1044738) (← links)
- A rewriting approach to binary decision diagrams (Q1349250) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- On uncertainty versus size in branching programs. (Q1401198) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
