Rubinstein, Aviad Detecting communities is hard (and counting them is even harder). (English) Zbl 1402.68106 Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 42, 13 p. (2017). MSC: 68Q25 05C82 68Q17 68R10 91D30 PDFBibTeX XMLCite \textit{A. Rubinstein}, LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 42, 13 p. (2017; Zbl 1402.68106) Full Text: DOI arXiv
Calude, Cristian S.; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank Deciding parity games in quasipolynomial time. (English) Zbl 1369.68234 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 252-263 (2017). MSC: 68Q25 91A43 PDFBibTeX XMLCite \textit{C. S. Calude} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 252--263 (2017; Zbl 1369.68234) Full Text: DOI
Wilson, Mark C.; Pritchard, Geoffrey Probability calculations under the IAC hypothesis. (English) Zbl 1141.91379 Math. Soc. Sci. 54, No. 3, 244-256 (2007). MSC: 91B14 52A38 52B55 52C07 60C05 60D05 91B12 PDFBibTeX XMLCite \textit{M. C. Wilson} and \textit{G. Pritchard}, Math. Soc. Sci. 54, No. 3, 244--256 (2007; Zbl 1141.91379) Full Text: DOI arXiv