TY - GEN
T1 - Decision complexity in dynamic geometry
AU - Kortenkamp, Ulrich
AU - Richter-Gebert, Jürgen
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84949493318&partnerID=8YFLogxK
U2 - 10.1007/3-540-45410-1_12
DO - 10.1007/3-540-45410-1_12
M3 - Conference contribution
AN - SCOPUS:84949493318
SN - 3540425985
SN - 9783540425984
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 193
EP - 198
BT - Automated Deduction in Geometry - 3rd International Workshop, ADG 2000, Revised Papers
A2 - Richter-Gebert, Jurgen
A2 - Wang, Dongming
PB - Springer Verlag
T2 - 3rd International Workshop on Automated Deduction in Geometry, ADG 2000
Y2 - 25 September 2000 through 27 September 2000
ER -