Decision Complexity in Dynamic Geometry

Authors:
Ulrich Kortenkamp;Jürgen Richter-Gebert
Affiliations:
-;-
Venue:
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Year:
2000

Citing 5
Cited 1

Greatest common divisors of polynomials given by straight-line programs

Journal of the ACM (JACM)
The parallel numerical method of mechanical theorem proving

Theoretical Computer Science
Mechanical theorem proving in geometries

Mechanical theorem proving in geometries
Randomized algorithms

Randomized algorithms
Probabilistic algorithms for verification of polynomial identities (invited)

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation

On the decidability of tracing problems in dynamic geometry

ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

Geometric straight-line programs [5,9] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding whether two instances of the same geometric straight-line program are connected by a continuous path, the Complex Reachability Problem.