Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity

Publications

Teaching

Workshops

Computational Complexity - Bachelor's and Master's Theses

Moritz Hardt: Testing Polynomial Identities with Fewer Random Bits

Master's Thesis, 2007.

Advisor: Prof. Dr. Markus Bläser

Related Publications

• [P]Markus Bläser, Moritz Hardt, David Steurer
Asymptotically Optimal Hitting Sets Against Polynomials.
International Colloquium on Automata, Languages and Programming (ICALP) in Lecture Notes in Computer Science 5125:345-356. Springer, 2008.
PDF
• [J]Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi
Deterministically Testing Sparse Polynomial Identities of Unbounded Degree.
Information Processing Letters, 109(3):187-192, 2009.
PDF