01895nam 2200349 450 991051049250332120230827200518.0(CKB)4930000000238182(NjHacI)994930000000238182(EXLCZ)99493000000023818220230827d2021 uy 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierSTOC '21 proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing : June 21-25, 2021, Virtual, Italy /Samir Khuller, Virginia Vassilevska Williams, editorsNew York, NY :Association for Computing Machinery,2021.1 online resource illustrations1-4503-8053-0 The papers in this volume were presented at the Fifty Third Annual ACM Symposium on Theory of Computing (STOC 2021), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was originally planned to be held in Rome, but due to the COVID-19 pandemic it was held virtually. The papers were presented as pre-recorded video talks, during poster sessions and as live online talks in sessions held between June 21-25, 2021. STOC 2021 was part of Theory Fest that also included several workshops and tutorials, keynote lectures by Alfred V. Aho, John Martinis, Kobbi Nissim, and Toniann Pitassi, an event commemorating the 50th Anniversary of the Cook-Levin Theorem, the 2021 Knuth Prize lecture, and the 2021 Gödel Prize lecture.Computational complexityCongressesComputational complexity511.3Williams Virginia VassilevskaKhuller SamirNjHacINjHaclBOOK9910510492503321STOC '213451247UNINA