Towards a Study of Low-Complexity Graphs

DOI10.1007/978-3-642-02927-1_12zbMath1248.68365OpenAlexW1868133269MaRDI QIDQ3638029

David Steurer, Sanjeev Arora, Avi Wigderson

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Local Reductions ⋮ Local reduction ⋮ Local expanders ⋮ Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)

This page was built for publication: Towards a Study of Low-Complexity Graphs