10997 search results - page 55 / 2200 » On the Structure of Complete Sets |
DAGSTUHL
2007
13 years 11 months ago
2007
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper gives a complete axiomatization of t...
SIAMDM
2008
13 years 10 months ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
EOR
2002
13 years 9 months ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
IPL
2002
13 years 9 months ago
2002
It is shown that for any class C closed under linear-time reductions, the complete sets for C under sublogarithmic reductions are also complete under 2DFA reductions, and thus are...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...