650 search results - page 21 / 130 » On Coalgebras over Algebras |
113
click to vote
ISSAC
2007
Springer
15 years 4 months ago
2007
Springer
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
74
Voted
CALCO
2005
Springer
15 years 4 months ago
2005
Springer
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
CIE
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
ISSAC
1997
Springer
15 years 2 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
FSTTCS
2007
Springer
15 years 4 months ago
2007
Springer