Braverman, Mark; Ko, Young Kun Information value of two-prover games. (English) Zbl 1462.68055 Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 12, 15 p. (2018). MSC: 68Q11 91A80 PDFBibTeX XMLCite \textit{M. Braverman} and \textit{Y. K. Ko}, LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 12, 15 p. (2018; Zbl 1462.68055) Full Text: DOI
Braverman, Mark; Garg, Ankit; Ko, Young Kun; Mao, Jieming; Touchette, Dave Near-optimal bounds on the bounded-round quantum communication complexity of disjointness. (English) Zbl 1408.68062 SIAM J. Comput. 47, No. 6, 2277-2314 (2018). Reviewer: Alexander Yurevich Vlasov (Sankt-Peterburg) MSC: 68Q12 81P68 PDFBibTeX XMLCite \textit{M. Braverman} et al., SIAM J. Comput. 47, No. 6, 2277--2314 (2018; Zbl 1408.68062) Full Text: DOI arXiv