@conference {KorRic-DCDG-2001,
	title = {Decision complexity in {D}ynamic {G}eometry},
	booktitle = {Proceedings of ADG 2000},
	series = {Lecture Notes in Artificial Intelligence},
	number = {2061},
	year = {2001},
	pages = {167{\textendash}172},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Heidelberg},
	abstract = {<p>
	Geometric straight-line programs [5,8] 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.</p>
},
	keywords = {refereed},
	url = {http://kortenkamps.net/papers/2001/36_DecisionComplexity.pdf},
	author = {Kortenkamp, Ulrich and Richter-Gebert, J{\"u}rgen},
	editor = {Wang, Dongming}
}
@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 = {<p>
	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.</p>
},
	keywords = {refereed},
	url = {http://kortenkamps.net/papers/2000/ADG2000_UK.pdf},
	author = {Kortenkamp, Ulrich and Richter-Gebert, J{\"u}rgen},
	editor = {Wang, Dongming}
}
