Pages that link to "Item:Q1140426"
From MaRDI portal
The following pages link to Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426):
Displaying 21 items.
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Highly symmetric expanders (Q700158) (← links)
- Size-space tradeoffs for oblivious computations (Q1052095) (← links)
- The performance of multilective VLSI algorithms (Q1069297) (← links)
- Two time-space tradeoffs for element distinctness (Q1095660) (← links)
- Time-space efficient algorithms for computing convolutions and related problems (Q1098288) (← links)
- Upper bounds for time-space trade-offs in sorting and selection (Q1101238) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- Superconcentrators of depth 2 (Q1162816) (← links)
- Size bounds for superconcentrators (Q1170885) (← 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)
- The computational complexity of universal hashing (Q1208411) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
- On Reducing the Space Requirements of a Straight-Line Algorithm (Q3332245) (← links)
- On time versus space III (Q3745280) (← links)
- Diameters and Eigenvalues (Q3834081) (← links)
- Extending the Hong-Kung model to memory hierarchies (Q6064031) (← links)
- Approximation of seismic velocities from the spectrum of weighted graphs (Q6170696) (← links)
