Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

FSTTCS
2005
Springer

favoriteEmaildiscussreport

85views Software Engineering» more FSTTCS 2005»

Proving Lower Bounds Via Pseudo-random Generators

14 years 4 months ago

Proving Lower Bounds Via Pseudo-random Generators

Download www.cse.iitk.ac.in

Manindra Agrawal

Real-time Traffic

FSTTCS 2005 |

claim paper

Related Content

» NearOptimal Conversion of Hardness into PseudoRandomness

» Improving the SpaceBounded Version of Muchniks Conditional Complexity Theorem via Naive De...

» A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints

» Pseudorandom graphs and bit probe schemes with onesided error

» Lower Bounds for Agnostic Learning via Approximate Rank

» Property Testing Lower Bounds via Communication Complexity

» GPU random numbers via the tiny encryption algorithm

» Lower Bounds on Near Neighbor Search via Metric Expansion

» Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FSTTCS
Authors	Manindra Agrawal

Comments (0)