2252 search results - page 7 / 451 » Lower Bounds for Dynamic Algorithms |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
STOC
2003
ACM
14 years 7 months ago
2003
ACM
STOC
2010
ACM
14 years 4 months ago
2010
ACM
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
FOCS
2002
IEEE
14 years 14 days ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....