Pages that link to "Item:Q1236886"
From MaRDI portal
The following pages link to Graph-theoretic properties in computational complexity (Q1236886):
Displaying 22 items.
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Highly symmetric expanders (Q700158) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- Hamiltonian paths in Cayley graphs (Q1044918) (← links)
- Size-space tradeoffs for oblivious computations (Q1052095) (← links)
- The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms (Q1069699) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines (Q1122982) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426) (← links)
- Superconcentrators of depth 2 (Q1162816) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- A note on a construction of Margulis (Q1254231) (← links)
- A note on time-space tradeoffs for computing continuous functions (Q1259903) (← links)
- Multi-processor scheduling and expanders (Q1336770) (← links)
- Recursive construction for 3-regular expanders (Q1343165) (← links)
- Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors (Q1928497) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Matrix rigidity (Q1970501) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- On 3-pushdown graphs with large separators (Q2277467) (← links)
- Lower Bounds for the Size of Nondeterministic Circuits (Q3196391) (← links)
- (Q5874542) (← links)
