TC0 - Document - PDFSEARCH.IO - Document Search Engine

First Page		Document Content
Date: 2001-06-15 14:23:26 Complexity classes Circuit complexity ACC0 Natural proof Pseudorandom generator TC0 AC0 Parity function EXPTIME Theoretical computer science Computational complexity theory Applied mathematics		Add to Reading List Source URL: ftp.cs.rutgers.edu Download Document from Source Website File Size: 213,13 KB Share Document on Facebook

	Candidate Weak Pseudorandom Functions in AC0 ◦ MOD2 Adi Akavia∗ Andrej Bogdanov† Siyao Guo‡ DocID: 1udBu - View Document
	Subexponential AC0-Frege Simulates Frege Yuval Filmus1 Toniann Pitassi1 Rahul Santhanam2 1 2 DocID: 1ubEl - View Document
	A simple proof of Bazzi’s theorem ALEXANDER RAZBOROV University of Chicago In 1990, Linial and Nisan asked if any polylog-wise independent distribution fools any function in AC0 . In a recent remarkable development, Ba DocID: 1nZUL - View Document
	THE SIGN-RANK OF AC0 ∗ ALEXANDER A. RAZBOROV† AND ALEXANDER A. SHERSTOV‡ Abstract. The sign-rank of a matrix A = [Aij ] with ±1 entries is the least rank of a real DocID: 1mq7B - View Document
	A simple proof of Bazzi’s theorem ALEXANDER RAZBOROV University of Chicago In 1990, Linial and Nisan asked if any polylog-wise independent distribution fools any function in AC0 . In a recent remarkable development, Ba DocID: 1m8yg - View Document