388 search results - page 67 / 78 » Quantum Lower Bounds by Polynomials |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
SIROCCO
2004
13 years 9 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...