Degree bounds and lifting techniques for triangular sets

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

Volumn , Issue , 2002, Pages 238-245

  Schost, Éric ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTER SIMULATION; CRYPTOGRAPHY; MATRIX ALGEBRA; NUMBER THEORY; POLES AND ZEROS; SET THEORY; THEOREM PROVING;

DEGREE BOUNDS; LIFTING TECHNIQUES; TRIANGULAR SETS;

POLYNOMIALS;

EID: 0036045852     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780537     Document Type: Conference Paper

References (25)

1. On the theories of triangular sets
2. Representation for the radical of a finitely generated differential ideal
3. Efficient algorithms and bounds for Wu-Ritt characteristic sets
4. On the invariants of the quotients of the Jacobian of a curve of genus 2
5. Lower bounds for diophantine approximation
6. Straight-line programs in geometric elimination theory
7. When polynomial equation systems can be solved fast?
8. A Gröbner free alternative for polynomial system solving
9. Definability and fast quantifier elimination in algebraically closed fields
10. Deformation techniques for efficient polynomial equation solving
11. On intrinsic bounds in the Nullstellensatz
12. Solving zero-dimensional algebraic systems
13. The differential ideal [P]: M∞
14. Bounds for traces in complete intersections and degrees in the Nullstellensatz
15. Computing parametric geometric resolutions