1331 search results - page 120 / 267 » Complexity bounds for zero-test algorithms |
JCSS
2007
13 years 10 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
COMPGEOM
2003
ACM
14 years 3 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
EJC
2010
13 years 10 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
We consider source coding with fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding wit...
PODC
2009
ACM
14 years 10 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...