2767 search results - page 80 / 554 » Universal Exponentiation Algorithm |
FOCS
2008
IEEE
14 years 11 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
COCO
2008
Springer
14 years 11 months ago
2008
Springer
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
SPIRE
2000
Springer
15 years 1 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
CORR
2008
Springer
14 years 10 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...