1730 search results - page 180 / 346 » Algebra and Computation |
125
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
112
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
113
click to vote
FOCM
2008
15 years 4 months ago
2008
We develop new computational algorithms, based on the method of equivariant moving frames, for classifying the differential invariants of Lie symmetry pseudo-groups of differential...
107
click to vote
JSC
2006
15 years 3 months ago
2006
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
110
click to vote
ENTCS
2002
15 years 3 months ago
2002
If S = 0 is a system of n equations and unknowns over C and S() = 0 to what extent can we compute with the point ? In particular, can we decide whether or not a polynomial express...