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

	A stateful implementation of a random function supporting parity queries over hypercubes Andrej Bogdanov and Hoeteck Wee Computer Science Division University of California, Berkeley {adib,hoeteck}@cs.berkeley.edu DocID: 1tP0H - View Document
	RANGE, PARITY AND PERIODICITY 5 minute review. Recap the definition of a function, and the meaning of domain, range, even/odd functions and periodicity. Warm-up. An open box is made by folding a square piece of card of DocID: 1tDsr - View Document
	Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, Germany DocID: 1qO3E - View Document
	ALIQUOT SEQUENCES WITH SMALL STARTING VALUES WIEB BOSMA Abstract. We describe the results of the computation of aliquot sequences with small starting values. In particular all sequences with starting values less than a m DocID: 1qF6q - View Document
	An earlier version of this paper appeared in EurocryptSecurity/Eﬃciency Tradeoﬀs for Permutation-Based Hashing Phillip Rogaway1 and John Steinberger2 1 DocID: 1q3qz - View Document