TY - GEN

T1 - Explicit near-Ramanujan graphs of every degree

AU - Mohanty, Sidhanth

AU - O'Donnell, Ryan

AU - Paredes, Pedro

N1 - Publisher Copyright:
© 2020 ACM.

PY - 2020/6/8

Y1 - 2020/6/8

N2 - For every constant d ≥ 3 and " > 0, we give a deterministic poly(n)-time algorithm that outputs a d-regular graph on (n) vertices that is "-near-Ramanujan; i.e., its eigenvalues are bounded in magnitude by 2gd-1 + " (excluding the single trivial eigenvalue of d).

AB - For every constant d ≥ 3 and " > 0, we give a deterministic poly(n)-time algorithm that outputs a d-regular graph on (n) vertices that is "-near-Ramanujan; i.e., its eigenvalues are bounded in magnitude by 2gd-1 + " (excluding the single trivial eigenvalue of d).

KW - Explicit Ramanujan graphs

UR - http://www.scopus.com/inward/record.url?scp=85086762247&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85086762247&partnerID=8YFLogxK

U2 - 10.1145/3357713.3384231

DO - 10.1145/3357713.3384231

M3 - Conference contribution

AN - SCOPUS:85086762247

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 510

EP - 523

BT - STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

A2 - Makarychev, Konstantin

A2 - Makarychev, Yury

A2 - Tulsiani, Madhur

A2 - Kamath, Gautam

A2 - Chuzhoy, Julia

PB - Association for Computing Machinery

T2 - 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020

Y2 - 22 June 2020 through 26 June 2020

ER -