855 search results - page 16 / 171 » Complexity of Equations over Sets of Natural Numbers |
ACTA
2006
14 years 9 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
COLT
2000
Springer
15 years 2 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
15 years 3 months ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
SIAMAM
2000
14 years 9 months ago
2000
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...