The following pages link to Superconcentrators (Q4134003):
Displaying 35 items.
- Complexity of linear circuits and geometry (Q300885) (← links)
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- Highly symmetric expanders (Q700158) (← links)
- Smaller superconcentrators of density 28 (Q844173) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Size-space tradeoffs for oblivious computations (Q1052095) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- On using deterministic functions to reduce randomness in probabilistic algorithms (Q1094137) (← links)
- Expanders obtained from affine transformations (Q1098859) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- Pebbling with an auxiliary pushdown (Q1156489) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Superconcentrators of depth 2 (Q1162816) (← links)
- Explicit constructions of linear-sized superconcentrators (Q1165257) (← links)
- Size bounds for superconcentrators (Q1170885) (← links)
- Invariant and geometric aspects of algebraic complexity theory. I (Q1176389) (← links)
- Three-regular path pairable graphs (Q1187948) (← links)
- A note on a construction of Margulis (Q1254231) (← links)
- Time-space trade-offs in a pebble game (Q1254254) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Multi-processor scheduling and expanders (Q1336770) (← links)
- Recursive construction for 3-regular expanders (Q1343165) (← links)
- Finite fields and Ramanujan graphs (Q1362096) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Rounds versus time for the two person pebble game (Q2641235) (← links)
- On the spectral distribution of large weighted random regular graphs (Q2935252) (← links)
- Uniformly Exhaustive Submeasures and Nearly Additive Set Functions (Q3037711) (← links)
- Explicit Concentrators from Generalized <i>N</i>-Gons (Q3216690) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- Rounds versus time for the two person pebble game (Q5096183) (← links)
