On the intrinsic complexity of elimination problems in effective Algebraic Geometry

Details On the intrinsic complexity of elimination problems in effective Algebraic Geometry On the intrinsic complexity of elimination problems in effective Algebraic Geometry

2012-01-20

arxiv.org/abs/1201.4344v2

Computer Science

Computational Complexity

37 pages. arXiv admin note: substantial text overlap with arXiv:1110.3030

Scientific paper

The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective algebraic geometry and show the intrinsically exponential complexity character of elimination in this complexity model.

Affiliated with

Also associated with

No associations

Rating

On the intrinsic complexity of elimination problems in effective Algebraic Geometry 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 On the intrinsic complexity of elimination problems in effective Algebraic Geometry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the intrinsic complexity of elimination problems in effective Algebraic Geometry will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-321221