Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets
| dc.creator | Geerts, Floris | |
| dc.creator | Smits, Lieven | |
| dc.creator | Bussche, Jan Van den | |
| dc.date | 2003-08-01 | |
| dc.date | 2003-08-01 | |
| dc.date.accessioned | 2026-07-07T03:20:10Z | |
| dc.date.available | 2026-07-07T03:20:10Z | |
| dc.description | 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. | |
| dc.description | corrected minor confusion in Proof of Theorem 1 | |
| dc.identifier | https://arxiv.org/abs/cs/0308001 | |
| dc.identifier | http://arxiv.org/abs/cs/0308001 | |
| dc.identifier | A revised version has been published online (21 July 2005) in Acta Informatica under the title "N- versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets" | |
| dc.identifier | doi:10.1007/s00236-005-0171-5 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31733 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Computational Geometry | |
| dc.subject | Databases | |
| dc.subject | F.4.1; F.2.2; H.2.8 | |
| dc.title | Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets | |
| dc.type | text |