146 search results - page 12 / 30 » The Complexity of Integer Bound Propagation |
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
FM
2008
Springer
14 years 11 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
ESA
2007
Springer
15 years 3 months ago
2007
Springer
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
90
Voted
SAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...