Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
33
click to vote
AAECC
2004
Springer
favorite
Email
discuss
report
63
views
Algorithms
»
more
AAECC 2004
»
Computation of the Decomposition Group of a Triangular Ideal
14 years 10 days ago
Download
www-calfor.lip6.fr
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generated by a triangular system of generators.
I. Abdeljaouad-Tej, Sébastien Orange, Gu&ea
Real-time Traffic
AAECC 2004
|
Algorithms
|
Decomposition Groups
|
Perfect Field
|
Polynomials
|
claim paper
Post Info
More Details (n/a)
Added
15 Dec 2010
Updated
15 Dec 2010
Type
Journal
Year
2004
Where
AAECC
Authors
I. Abdeljaouad-Tej, Sébastien Orange, Guénaël Renault, Annick Valibouze
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision