\(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets

DOI10.1007/s00236-005-0171-5zbMath1079.68027OpenAlexW2034824054MaRDI QIDQ2576661

Lieven Smits, Jan Van den Bussche, Floris Geerts

Publication date: 14 December 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0171-5

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Reachability and connectivity queries in constraint databases
• Adding a path connectedness operator to \(FO+poly(linear)\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets