The non-adaptive query complexity of testing k-parities

First Page		Document Content
Date: 2013-07-24 10:17:39 Computational complexity theory Quantum information science Communication Communication complexity Quantum complexity theory Parity function Entropy Circuit complexity Decision tree model Theoretical computer science Applied mathematics Mathematics		The non-adaptive query complexity of testing k-parities Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 204,84 KB Share Document on Facebook

	CS378, MA375T, PHY341 Homework 1 Homework 1 Introduction to Quantum Information Science DocID: 1xVZC - View Document
	CS378, MA375T, PHY341 Homework 2 Homework 2 Introduction to Quantum Information Science DocID: 1xVYW - View Document
	CS378, MA375T, PHY341 Homework 9 Homework 9 Introduction to Quantum Information Science DocID: 1xVwY - View Document
	CS378, MA375T, PHY341 Homework 4 Homework 4 Introduction to Quantum Information Science DocID: 1xVe2 - View Document
	CS378, MA375T, PHY341 Homework 6 Homework 6 Introduction to Quantum Information Science DocID: 1xUVZ - View Document