Sciweavers

3415 search results - page 85 / 683

» Lower Bounds for Kernelizations

133

WDAG
2000
Springer

79views Algorithms» more WDAG 2000»

Lower Bounds in Distributed Computing

15 years 10 months ago

Lower Bounds in Distributed Computing

Download groups.csail.mit.edu

Faith Ellen Fich, Eric Ruppert

claim paper

Read More »

118

WG
2000
Springer

66views Theoretical Computer Science» more WG 2000»

New Spectral Lower Bounds on the Bisection Width of Graphs

15 years 10 months ago

New Spectral Lower Bounds on the Bisection Width of Graphs

Download www2.math.uni-paderborn.de

Sergei L. Bezrukov, Robert Elsässer, Burkhard...

claim paper

Read More »

140

FOCS
1995
IEEE

84views Theoretical Computer Science» more FOCS 1995»

Lower Bounds for Monotone Span Programs

15 years 10 months ago

Lower Bounds for Monotone Span Programs

Download people.cs.uchicago.edu

Amos Beimel, Anna Gál, Mike Paterson

claim paper

Read More »

137

STOC
1995
ACM

117views Algorithms» more STOC 1995»

Lower bounds for sorting networks

15 years 9 months ago

Lower bounds for sorting networks

Download nkahale.free.fr

Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. ...

claim paper

Read More »

140

FOCS
1991
IEEE

126views Theoretical Computer Science» more FOCS 1991»

Communication Complexity Towards Lower Bounds on Circuit Depth

15 years 9 months ago

Communication Complexity Towards Lower Bounds on Circuit Depth

Download www.cse.yorku.ca

Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean

Jeff Edmonds, Steven Rudich, Russell Impagliazzo, ...

claim paper

Read More »

« Prev « First page 85 / 683 Last » Next »