First Page | Document Content | |
---|---|---|
Date: 2014-04-12 03:40:34Communication Communication complexity Computational complexity theory Quantum complexity theory Quantum information science | Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11.Add to Reading ListSource URL: people.cs.uchicago.eduDownload Document from Source WebsiteFile Size: 88,27 KBShare Document on Facebook |
CS378, MA375T, PHY341 Homework 1 Homework 1 Introduction to Quantum Information ScienceDocID: 1xVZC - View Document | |
CS378, MA375T, PHY341 Homework 2 Homework 2 Introduction to Quantum Information ScienceDocID: 1xVYW - View Document | |
CS378, MA375T, PHY341 Homework 9 Homework 9 Introduction to Quantum Information ScienceDocID: 1xVwY - View Document | |
CS378, MA375T, PHY341 Homework 4 Homework 4 Introduction to Quantum Information ScienceDocID: 1xVe2 - View Document | |
CS378, MA375T, PHY341 Homework 6 Homework 6 Introduction to Quantum Information ScienceDocID: 1xUVZ - View Document |