1730 search results - page 86 / 346 » Algebra and Computation |
80
Voted
JSC
2002
15 years 9 days ago
2002
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
92
Voted
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
105
click to vote
DIS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
110
Voted
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...