536 search results - page 7 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
TCS
2008
13 years 7 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...