3454 search results - page 9 / 691 » Modern computer algebra |
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
JSC
2010
13 years 6 months ago
2010
We describe an algorithm for computing automorphism groups and testing isomorphisms of finite dimensional Lie algebras over finite fields. The algorithm is particularly effect...
TOCL
2002
13 years 7 months ago
2002
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
We overview CASL, the CoGenT Architecture Specification Language, a mixed behavioral-structure architecture description language designed to facilitate fast prototyping and tool ...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. GPUs offer a tremendous amount of computational bandwidth that was until now largely unusable for cryptographic computations due to a lack of integer arithmetic and user...