Sciweavers

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

75

COCO
1995
Springer

favoriteEmaildiscussreport

85views Algorithms» more COCO 1995»

On Superlinear Lower Bounds in Complexity Theory

15 years 1 months ago

On Superlinear Lower Bounds in Complexity Theory

Download www.cse.buffalo.edu

Kenneth W. Regan

Real-time Traffic

Algorithms | COCO 1995 |

claim paper

Related Content

» Timespace tradeoffs in resolution superpolynomial lower bounds for superlinear space

» Algebrization A New Barrier in Complexity Theory

» Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory

» On Span Programs

» Cosmological lower bound on the circuit complexity of a small problem in logic

» Complexity of Boolean Functions on PRAMs Lower Bound Techniques

» Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions

» AverageCase Complexity of Shellsort

» Lower bounds in communication complexity based on factorization norms

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	1995
Where	COCO
Authors	Kenneth W. Regan

Comments (0)