The following pages link to Beate Bollig (Q171934):
Displaying 10 items.
- Improving the variable ordering of OBDDs is NP-complete (Q4420841) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
- (Q4536358) (← links)
- Read-once projections and formal circuit verification with binary decision diagrams (Q4593955) (← links)
- (Q4708564) (← links)
- (Q4885895) (← links)
- A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing (Q5175997) (← links)
- Exact OBDD Bounds for Some Fundamental Functions (Q5448645) (← links)
- Fundamentals of Computation Theory (Q5492933) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)