Proceedings of the forty-third annual ACM symposium on Theory of computing
From MaRDI portal
Publication:2905018
DOI10.1145/1993636zbMath1257.68018OpenAlexW4238717878MaRDI QIDQ2905018
No author found.
Publication date: 24 August 2012
Full work available at URL: https://doi.org/10.1145/1993636
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Theory of computing (68Qxx)
Related Items (5)
Majorization and the time complexity of linear optical networks ⋮ A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability ⋮ Simulating macroscopic quantum correlations in linear networks ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ Unnamed Item
This page was built for publication: Proceedings of the forty-third annual ACM symposium on Theory of computing
