117 search results - page 2 / 24 » On Superlinear Lower Bounds in Complexity Theory |
78
Voted
JACM
2002
14 years 9 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
116
Voted
DFG
1992
Springer
15 years 1 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
126
click to vote
CC
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
ICALP
1999
Springer
15 years 1 months ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....