×

Found 3 Documents (Results 1–3)

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field

Software