The following pages link to (Q4542589):
Displaying 18 items.
- 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)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- The hardest halfspace (Q1983325) (← links)
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication (Q2771493) (← links)
- A note on read-$k$ times branching programs (Q4362278) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
- (Q4471998) (← links)
- (Q4699324) (← links)
- On the hierarchy of nondeterministic branching k-programs (Q5055950) (← links)
- Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)
- Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)
