The following pages link to (Q4109584):
Displaying 13 items.
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer (Q1065546) (← links)
- The performance of multilective VLSI algorithms (Q1069297) (← links)
- Time-space efficient algorithms for computing convolutions and related problems (Q1098288) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- Additive complexity in directed computations (Q1164996) (← links)
- Extreme time-space tradeoffs for graphs with small space requirements (Q1173412) (← links)
- Time-space tradeoffs for algebraic problems on general sequential machines (Q1176102) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- Improved lower bounds on the rigidity of Hadamard matrices (Q1280658) (← links)
- Matrix rigidity (Q1970501) (← links)
- Extending the Hong-Kung model to memory hierarchies (Q6064031) (← links)
