Pages that link to "Item:Q4485697"
From MaRDI portal
The following pages link to Branching Programs and Binary Decision Diagrams (Q4485697):
Displaying 50 items.
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Exponential space complexity for OBDD-based reachability analysis (Q1675755) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- Branching constraint satisfaction problems and Markov decision problems compared (Q1861939) (← links)
- Sequential testing of complex systems: a review (Q1878412) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Relation-algebraic modeling and solution of chessboard independence and domination problems (Q1931899) (← links)
- Randomized OBDDs for the most significant bit of multiplication need exponential space (Q1944061) (← links)
- Exact OBDD bounds for some fundamental functions (Q1959388) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- On the relation between structured \(d\)-DNNFs and SDDs (Q2035477) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Graph coloring with decision diagrams (Q2118148) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Variable ordering for decision diagrams: a portfolio approach (Q2152280) (← links)
- Second-order finite automata (Q2158302) (← links)
- Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- Symbolic model checking for channel-based component connectors (Q2389338) (← links)
- State-set branching: leveraging BDDs for heuristic search (Q2389616) (← links)
- Theoretical insights and algorithmic tools for decision diagram-based optimization (Q2398513) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams (Q2399372) (← links)
- On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558) (← links)
- On compiling structured CNFs to OBDDs (Q2411046) (← links)
- New results on the most significant bit of integer multiplication (Q2429728) (← links)
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds (Q2430008) (← links)
- On the OBDD complexity of the most significant bit of integer multiplication (Q2430011) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400) (← links)
- Symbolic topological sorting with OBDDs (Q2465997) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Lower bounds for restricted read-once parity branching programs (Q2503280) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- State space analysis of Petri nets with relation-algebraic methods (Q2518607) (← links)
