Explicit near-Ramanujan graphs of every degree
- Award ID(s):
- 1717606
- PAR ID:
- 10142056
- Date Published:
- Journal Name:
- Proceedings of the Annual ACM Symposium on Theory of Computing
- ISSN:
- 0737-8017
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

