Sciweavers

467 search results - page 12 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
86
Voted
SIAMJO
2010
47views more  SIAMJO 2010»
14 years 6 months ago
Integer Programming Subject to Monomial Constraints
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
Christoph Buchheim, Dennis Michaels, Robert Weisma...
JC
2006
105views more  JC 2006»
14 years 11 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
CORR
2008
Springer
143views Education» more  CORR 2008»
14 years 11 months ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
DCC
2006
IEEE
15 years 11 months ago
Asymptotic Nonlinearity of Boolean Functions
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
François Rodier
ICFHR
2010
136views Biometrics» more  ICFHR 2010»
14 years 6 months ago
Digital Ink Compression via Functional Approximation
Representing digital ink traces as points in a function space has proven useful for online recognition. Ink trace coordinates or their integral invariants are written as parametri...
Vadim Mazalov, Stephen M. Watt