The intrinsic complexity of parametric elimination methods

Details The intrinsic complexity of parametric elimination methods The intrinsic complexity of parametric elimination methods

1997-07-09

arxiv.org/abs/alg-geom/9707006v1

Mathematics

Algebraic Geometry

LaTeX, 12 pages. To appear in Proc. of WAIT'97, Buenos Aires, Argentina, 1997

Scientific paper

This paper is devoted to the complexity analysis of a particular property,
called "algebraic robustness" owned by all known symbolic methods of parametric
polynomial equation solving (geometric elimination). It is shown that any
parametric elimination procedure which owns this property must neccessarily
have an exponential sequential time complexity.

Affiliated with

Also associated with

No associations

Rating

The intrinsic complexity of parametric elimination methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The intrinsic complexity of parametric elimination methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The intrinsic complexity of parametric elimination methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-487302