Semi-numerical determination of irreducible branches of a reduced space curve

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 137-142

  Galligo, A ^a   Rupprecht, D ^a  

^a UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; C (PROGRAMMING LANGUAGE); CALCULATIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DIGITAL ARITHMETIC;

GALOIS GROUP; IRREDUCIBLE BRANCHES; POLYNOMIAL FACTORIZATION; REDUCED SPACE CURVE;

POLYNOMIALS;

EID: 0034777193     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384121     Document Type: Conference Paper

References (7)

1. Practical determination of an algebraic variety
2. An absolute primality test for bivariate polynomials
3. Fast parallel absolute irreducibility testing
4. Effective noether irreducibility forms and applications
5. Ideal bases and primary decomposition: Case of two variables
6. Semi-numerical absolute factorization of polynomials with integer coefficients
7. Factoring polynomials and the knapsack problem