The following pages link to (Q3787930):
Displaying 10 items.
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- On problem transformability in VLSI (Q1101222) (← links)
- On the VLSI complexity of some arithmetic and numerical problems (Q1103401) (← links)
- Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits (Q1121671) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- (Q4009550) (← links)
- (Q4728216) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q5096789) (← links)
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity (Q6163615) (← links)
