Sciweavers

154 search results - page 1 / 31
» Using Galois Ideals for Computing Relative Resolvents
Sort
View
81
Voted
JSC
2000
49views more  JSC 2000»
15 years 28 days ago
Using Galois Ideals for Computing Relative Resolvents
Philippe Aubry, Annick Valibouze
114
Voted
AAECC
2008
Springer
63views Algorithms» more  AAECC 2008»
15 years 1 months ago
Probabilistic algorithms for computing resolvent representations of regular differential ideals
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...
Thomas Cluzeau, Evelyne Hubert
84
Voted
JC
2006
105views more  JC 2006»
15 years 1 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
116
Voted
MASCOTS
2008
15 years 2 months ago
Optimizing Galois Field Arithmetic for Diverse Processor Architectures and Applications
Galois field implementations are central to the design of many reliable and secure systems, with many systems implementing them in software. The two most common Galois field opera...
Kevin M. Greenan, Ethan L. Miller, Thomas J. E. Sc...
TAPOS
1998
126views more  TAPOS 1998»
15 years 24 days ago
Design of Class Hierarchies Based on Concept (Galois) Lattices
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
Robert Godin, Hafedh Mili, Guy W. Mineau, Rokia Mi...