2924 search results - page 170 / 585 » Lower Bounds in Distributed Computing |
136
click to vote
ICIC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
137
click to vote
ACSC
2005
IEEE
15 years 8 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
106
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
130
click to vote
AUTOMATICA
2008
15 years 3 months ago
2008
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...
112
click to vote
FOCM
2010
15 years 1 months ago
2010
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...