1092 search results - page 75 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
170
click to vote
COMPGEOM
2009
ACM
16 years 13 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
173
click to vote
ISAAC
2009
Springer
16 years 15 days ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
162
click to vote
CSCLP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
145
click to vote
DLT
2003
15 years 7 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
149
click to vote
JSC
2010
15 years 4 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...