@conference {KorRic-DCDG-2000, title = {Decision complexity in {D}ynamic {G}eometry}, booktitle = {Proceedings of ADG 2000}, series = {International Workshop on Automatic Deduction in Geometry}, volume = {3}, year = {2000}, note = {Extended Abstract}, pages = {216{\textendash}220}, abstract = {

Geometric straight-line programs [6, 10] can be used to model geo- metric 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.

}, keywords = {refereed}, url = {http://kortenkamps.net/papers/2000/ADG2000_UK.pdf}, author = {Kortenkamp, Ulrich and Richter-Gebert, J{\"u}rgen}, editor = {Wang, Dongming} }