557 search results - page 1 / 112 » A Type-Coercion Problem in Computer Algebra |
AISC
1992
Springer
13 years 9 months ago
1992
Springer
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
JSC
2002
13 years 4 months ago
2002
, Allen C.) see Innovations in teaching abstract algebra, 2003b:00019 Littlewood, D. E. The skeleton key of mathematics. (English summary) 2003j:01046 Magnin, Louis Quelques questi...
IJAC
2002
13 years 4 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
IJAC
2007
13 years 4 months ago
2007
In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exp...