The following pages link to (Q4818848):
Displaying 19 items.
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
- Randomized OBDDs for the most significant bit of multiplication need exponential space (Q1944061) (← links)
- New size hierarchies for two way automata (Q1992112) (← 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)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- The hierarchical model of branch planning with random coefficients (Q2488140) (← links)
- On the computational power of probabilistic and quantum branching program (Q2581534) (← links)
- Fractional pebbling and thrifty branching programs (Q2920118) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- (Q3974873) (← links)
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← links)
- Randomization and nondeterminism are comparable for ordered read-once branching programs (Q4571952) (← links)
- Improved pseudorandomness for unordered branching programs through local monotonicity (Q5230303) (← links)
- On BPP versus \(NP\cup coNP\) for ordered read-once branching programs (Q5941564) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)
- Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)
