557 search results - page 20 / 112 » A Type-Coercion Problem in Computer Algebra |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
ENTCS
2002
13 years 7 months ago
2002
Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...
AAECC
2002
Springer
13 years 7 months ago
2002
Springer
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...