scientific article
From MaRDI portal
Publication:3002825
DOI10.4086/toc.2010.v006a012zbMath1213.68440OpenAlexW2152293882MaRDI QIDQ3002825
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2010.v006a012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (12)
Partition expanders ⋮ Expansion in SL\(_2(\mathbb R)\) and monotone expanders ⋮ Layered separators in minor-closed graph classes with applications ⋮ Connections between graphs and matrix spaces ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ Towards lower bounds on locally testable codes via density arguments ⋮ Layouts of Expander Graphs ⋮ Subspace designs based on algebraic function fields ⋮ On exteriority notions in book embeddings and treewidth ⋮ Unnamed Item ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
This page was built for publication:
