Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHeintz, Joos-
dc.contributor.authorGiusti, Marc-
dc.contributor.authorKUIJPERS, Bart-
dc.description.abstractWe model the algorithmic task of geometric elimination (e.g., quantifier elimination in the elementary field theories of real and complex numbers) by means of certain constraint database queries, called geometric queries. As a particular case of such a geometric elimination task, we consider sample point queries. We show exponential lower complexity bounds for evaluating geometric queries in the general and in the particular case of sample point queries. Although this paper is of theoretical nature, its aim is to explore the possibilities and (complexity-)limits of computer implemented query evaluation algorithms for Constraint Databases, based on the principles of the most advanced geometric elimination procedures and their implementations, like, e.g., the software package ”Kronecker” (see [11]).-
dc.titleThe evaluation of geometric queries: constraint databases and quantifier elimination-
item.contributorHeintz, Joos-
item.contributorKUIJPERS, Bart-
item.contributorGiusti, Marc-
item.accessRightsOpen Access-
item.fullcitationHeintz, Joos; Giusti, Marc & KUIJPERS, Bart (2011) The evaluation of geometric queries: constraint databases and quantifier elimination.-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
giusti.pdf370.84 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.