199 search results - page 19 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
CHI
2009
ACM
14 years 9 months ago
2009
ACM
Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI ...
CASC
2009
Springer
14 years 3 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
UC
2005
Springer
14 years 2 months ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
MP
2006
13 years 8 months ago
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...