Abstract
A pseudorandom generator famously designed by Noam Nisan underlies many results and problems about low space-bounded complexity classes. Matei David and two co-authors recently proved a promising extension of the generator, enabling one to analyze multi-pass computations in these classes.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lipton, R.J., Regan, K.W. (2013). Matei David: Improving Noam Nisan’s Generator. In: People, Problems, and Proofs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41422-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-41422-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41421-3
Online ISBN: 978-3-642-41422-0
eBook Packages: Computer ScienceComputer Science (R0)