Cite
APA Citation
Gamarnik, D., & Li, Q. (2018). on the max‐cut of sparse random graphs. Random structures & algorithms, 52(2), 219–262. http://access.bl.uk/ark:/81055/vdc_100057432026.0x00003b
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Gamarnik, D., & Li, Q. (2018). on the max‐cut of sparse random graphs. Random structures & algorithms, 52(2), 219–262. http://access.bl.uk/ark:/81055/vdc_100057432026.0x00003b