Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Proving Lower Bounds via Pseudo-Random Manindra Agrawal
 

Summary: Proving Lower Bounds via Pseudo-Random
Generators
Manindra Agrawal
IIT Kanpur
FSTTCS 2005
Manindra Agrawal (IIT Kanpur) Proving Lower Bounds FSTTCS 2005 1 / 73
Overview
1 Lower Bounds History
2 Pseudo-Random Generators
3 Applications of Time-Bounded Pseudo-Random
Generators
Derandomizing Randomized Algorithms
Formalizing Cryptographic Security
Lower Bounds
4 Lower Bounds on Boolean Circuits
5 Lower Bounds on Arithmetic Circuits
Manindra Agrawal (IIT Kanpur) Proving Lower Bounds FSTTCS 2005 2 / 73
Outline
1 Lower Bounds History
2 Pseudo-Random Generators

  

Source: Agrawal, Manindra - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur

 

Collections: Computer Technologies and Information Sciences