@article{keyhere,
title = {Decision Complexity in Dynamic Geometry},
author = {Ulrich Kortenkamp and Jürgen Richter-Gebert},
journal = {Automated Deduction in Geometry},
pages = {193--198},
url = {http://dx.doi.org/10.1007/3-540-45410-1_12},
year = {2001},
description = {SpringerLink - Book Chapter},
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.},
keywords = {complexity dynamic geometry pt }
}
::