Please use this identifier to cite or link to this item:
|Title:||N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets||Other Titles:||Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets||Authors:||GEERTS, Floris
VAN DEN BUSSCHE, Jan
|Issue Date:||2004||Publisher:||SPRINGER||Source:||ACTA INFORMATICA, 42(1). p. 43-56||Abstract:||This paper addresses the question whether one can determine the connectivity of a semi-algebraic set in three dimensions by testing the connectivity of a finite number of two-dimensional “samples” of the set, where these samples are defined by first-order queries. The question is answered negatively for two classes of first-order queries: cartesian-product-free, and positive one-pass.||Document URI:||http://hdl.handle.net/1942/601||ISSN:||0001-5903||e-ISSN:||1432-0525||DOI:||10.1007/s00236-005-0171-5||ISI #:||000233637700003||Category:||A1||Type:||Journal Contribution||Validations:||ecoom 2006|
|Appears in Collections:||Research publications|
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.