922 search results - page 61 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
180
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
148
click to vote
SIAMMA
2010
15 years 1 months ago
2010
ABSTRACT. We prove the so-called generalized Haff's law yielding the optimal algebraic cooling rate of the temperature of a granular gas described by the homogeneous Boltzmann...
152
click to vote
EJC
2010
15 years 6 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
151
click to vote
JSYML
2010
15 years 1 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
161
click to vote
IPCO
2007
15 years 7 months ago
2007
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...