Pages that link to "Item:Q1121671"
From MaRDI portal
The following pages link to Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits (Q1121671):
Displaying 7 items.
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- The performance of multilective VLSI algorithms (Q1069297) (← links)
- A minimum-area circuit for \(\ell\)-selection (Q1092661) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- On the power of multiple reads in a chip (Q2366566) (← links)
- (Q4005192) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)