The following pages link to (Q4138137):
Displaying 10 items.
- Smaller superconcentrators of density 28 (Q844173) (← links)
- Size-space tradeoffs for oblivious computations (Q1052095) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Size bounds for superconcentrators (Q1170885) (← 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)
- Space bounds for a game on graphs (Q4143082) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Rounds versus time for the two person pebble game (Q5096183) (← links)
