\(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-005-0171-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034824054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability and connectivity queries in constraint databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding a path connectedness operator to \(FO+poly(linear)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4392286 / rank
 
Normal rank

Latest revision as of 14:11, 11 June 2024

scientific article
Language Label Description Also known as
English
\(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets
scientific article

    Statements

    \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2005
    0 references
    0 references
    0 references