778 search results - page 118 / 156 » Bounding Smooth Integers |
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
14 years 1 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
MYCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...