Unconditional Pseudorandom Generators for Low-Degree Polynomials

First Page		Document Content
Date: 2013-01-22 04:13:53 Applied mathematics Pseudorandomness Algorithmic information theory Pseudorandom generator Orthogonal polynomials Degree of a polynomial Dickson polynomial Schwartz–Zippel lemma Mathematics Polynomials Theoretical computer science		Unconditional Pseudorandom Generators for Low-Degree Polynomials Add to Reading List Source URL: www.theoryofcomputing.org Download Document from Source Website File Size: 234,29 KB Share Document on Facebook

	Stirling Numbers of the First Kind October 1, Getting to know the Stirling numbers DocID: 1ppyA - View Document
	Technion , December, Roots of graph polynomials Semantic vs Syntactic Properties of Graph Polynomials, I: DocID: W5vg - View Document
	Decomposition of a recursive family of polynomials ´ Andrej Dujella and Ivica Gusic Abstract We describe decomposition of polynomials fn := fn,B,a defined by DocID: O15B - View Document
	Weil Image Sums (and some related problems) September ,  ver. . DocID: 9zIU - View Document
	I93[removed]DICKSON ON THEORY OF NUMBERS DocID: 4NqU - View Document