Search Sciweavers | Sciweavers

3208 search results - page 79 / 642

» A Lower Bound for Primality

click to vote

FSTTCS
2001
Springer

92views Software Engineering» more FSTTCS 2001»

When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity

14 years 2 months ago

Download ftp.cs.rutgers.edu

This paper has the following goals: – To survey some of the recent developments in the ﬁeld of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...

Eric Allender

claim paper

Read More »

click to vote

WG
2001
Springer

93views Theoretical Computer Science» more WG 2001»

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

14 years 2 months ago

Download www.alice-dsl.net

Clemens Gröpl, Stefan Hougardy, Till Nierhoff...

claim paper

Read More »

click to vote

COCO
2000
Springer

123views Algorithms» more COCO 2000»

A Lower Bound for the Shortest Path Problem

14 years 2 months ago

Download people.cs.uchicago.edu

We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...

Ketan Mulmuley, Pradyut Shah

claim paper

Read More »

click to vote

FOCS
1999
IEEE

74views Theoretical Computer Science» more FOCS 1999»

A Non-linear Time Lower Bound for Boolean Branching Programs

14 years 2 months ago

Download cs.anu.edu.au

Miklós Ajtai

claim paper

Read More »