×

Found 5 Documents (Results 1–5)

Classical and quantum partition bound and detector inefficiency. (English) Zbl 1272.68145

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 617-628 (2012).
MSC:  68Q17 68Q05 68Q12
PDFBibTeX XMLCite
Full Text: DOI arXiv

Non-local box complexity and secure function evaluation. (English) Zbl 1248.68218

Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15–17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPIcs – Leibniz International Proceedings in Informatics 4, 239-250, electronic only (2009).
MSC:  68Q17 68Q12 68Q30 68Q05 94A60 94A05
PDFBibTeX XMLCite
Full Text: DOI Link

The communication complexity of non-signaling distributions. (English) Zbl 1250.68107

Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 270-281 (2009).
MSC:  68Q05 68Q12 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field