Proceedings of the 43rd annual ACM symposium on theory of computing, STOC '11. San Jose, CA, USA, June 6--8, 2011.

DOI10.1145/1993636zbMATH Open1257.68018OpenAlexW4238717878MaRDI QIDQ2905018FDOQ2905018

Authors:

Publication date: 24 August 2012

Full work available at URL: https://doi.org/10.1145/1993636

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Theory of computing (68Qxx)

Cited In (10)

• Title not available (Why is that?)
• Majorization and the time complexity of linear optical networks
• Compression via matroids: a randomized polynomial kernel for odd cycle transversal
• A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
• Proceedings of the forty-first annual ACM symposium on Theory of computing
• A local lemma for focused stochastic algorithms
• Proceedings of the forty-fourth annual ACM symposium on Theory of computing
• Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78
• Simulating macroscopic quantum correlations in linear networks
• Title not available (Why is that?)

This page was built for publication: Proceedings of the 43rd annual ACM symposium on theory of computing, STOC '11. San Jose, CA, USA, June 6--8, 2011.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905018)