A Parallel Cylindrical Algebraic Decomposition Algorithm for Quantifier Elimination on Real Closed Fields

Details A Parallel Cylindrical Algebraic Decomposition Algorithm for Quantifier Elimination on Real Closed Fields A Parallel Cylindrical Algebraic Decomposition Algorithm for Quantifier Elimination on Real Closed Fields

2011-12-22

arxiv.org/abs/1112.5352v2

Computer Science

Discrete Mathematics

8 pages

Scientific paper

In this paper we propose a parallel approach to quantifier elimination on real closed fields through a modification in the cylindrical algebraic decomposition (CAD) algorithm to accommodate parallelism. In this approach the speed-up due to parallelism obtained on an input formula is a property of that formula itself. Hence the time complexity of algorithm depends on not just the size of the input but on the input self. We classify prenex formulae depending on the amount of input-based parallelism that can be obtained from it based on which we obtain some insights into the complexity of the algorithm. We demonstrate performance of the proposed algorithm with experimental results.

Affiliated with

Also associated with

No associations

Rating

A Parallel Cylindrical Algebraic Decomposition Algorithm for Quantifier Elimination on Real Closed Fields 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 A Parallel Cylindrical Algebraic Decomposition Algorithm for Quantifier Elimination on Real Closed Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Parallel Cylindrical Algebraic Decomposition Algorithm for Quantifier Elimination on Real Closed Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307610