220 search results - page 7 / 44 » On Nets, Algebras and Modularity |
CJ
2000
14 years 9 months ago
2000
107
click to vote
ISSAC
2007
Springer
15 years 3 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...
LPNMR
2005
Springer
15 years 2 months ago
2005
Springer
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
APN
2010
Springer
15 years 2 months ago
2010
Springer
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
CORR
2010
Springer
14 years 9 months ago
2010
Springer