Pages that link to "Item:Q1165257"
From MaRDI portal
The following pages link to Explicit constructions of linear-sized superconcentrators (Q1165257):
Displaying 50 items.
- Expansion in SL\(_2(\mathbb R)\) and monotone expanders (Q352121) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- On Laplacians of random complexes (Q503252) (← links)
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Improved sorting networks with O(log N) depth (Q582098) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Highly symmetric expanders (Q700158) (← links)
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators (Q800384) (← links)
- Note on the girth of Ramanujan graphs (Q920107) (← links)
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
- Sorting in \(c \log n\) parallel steps (Q1056541) (← 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)
- Lower bounds for synchronous circuits and planar circuits (Q1114661) (← links)
- Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
- Sorting in linear time? (Q1273863) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Shallow grates (Q1314391) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- Recursive construction for 3-regular expanders (Q1343165) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- On the approximability of the Steiner tree problem. (Q1401253) (← links)
- Equivalent literal propagation in the DLL procedure (Q1408382) (← links)
- Construction of halvers (Q1606915) (← links)
- Local expanders (Q1653336) (← links)
- Rigidity of warped cones and coarse geometry of expanders (Q1731574) (← links)
- Discrete fundamental groups of warped cones and expanders (Q1741823) (← links)
- Universal traversal sequences for expander graphs (Q1802060) (← links)
- Natural bounded concentrators (Q1842573) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- Derandomized graph products (Q1842777) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- The symmetry rule in propositional logic (Q1961453) (← links)
- Super-expanders and warped cones (Q2027748) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- The exact convergence rate in the ergodic theorem of Lubotzky-Phillips-Sarnak and a universal lower bound on discrepancies (Q2077236) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- A spanner for the day after (Q2223618) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Explicit expanding expanders (Q2408170) (← links)
- Dual VP classes (Q2410687) (← links)
- Computation of best possible low degree expanders (Q2462391) (← links)
- Dense expanders and pseudo-random bipartite graphs (Q2640620) (← links)
- Geometric structures in group theory. Abstracts from the workshop held February 27 -- March 5, 2022 (Q2693038) (← links)
