557 search results - page 8 / 112 » A Type-Coercion Problem in Computer Algebra |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
SIAMSC
2011
13 years 2 months ago
2011
We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements...
BIRTHDAY
2003
Springer
13 years 11 months ago
2003
Springer
We prove in this paper that if r and s are two semilinear power series in commuting variables and s has bounded coefficients, then r-s is a rational series. This result can be tho...
BIOCOMP
2006
13 years 9 months ago
2006
The use of computer algebra software has many applications in diverse fields like epidemiology. This work pretends to show how computer algebra software applications for symbolic ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...