Treffer: Decision complexity in dynamic geometry
Title:
Decision complexity in dynamic geometry
Authors:
Source:
ADG 2000 : automated deduction in geometry (Zurich, 25-27 September 2000, revised papers)Lecture notes in computer science. :193-198
Publisher Information:
Berlin: Springer, 2001.
Publication Year:
2001
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Fonctions de plusieurs variables complexes et espaces analytiques, Several complex variables and analytic spaces, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Résolution de problèmes, jeux, Problem solving, game playing, Atteignabilité, Reachability, Asequibilidad, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Démonstration théorème, Theorem proving, Demostración teorema, Forme rectiligne, Straight shape, Forma rectilínea, Modèle géométrique, Geometrical model, Modelo geométrico
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institut für Informatik, Freie Universität Berlin, Takustr. 9, 14195 Berlin, Germany
Zentrum Mathematik, SB4, Technische Universität München, 80290 München, Germany
Zentrum Mathematik, SB4, Technische Universität München, 80290 München, Germany
ISSN:
0302-9743
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.14047910
Database:
PASCAL Archive
Weitere Informationen
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.