Computational complexity of diagram satisfaction in Euclidean geometry (Q2489144)

From MaRDI portal
Revision as of 06:53, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational complexity of diagram satisfaction in Euclidean geometry
scientific article

    Statements

    Computational complexity of diagram satisfaction in Euclidean geometry (English)
    0 references
    0 references
    16 May 2006
    0 references
    0 references
    Euclidean geometry
    0 references
    Diagrams
    0 references
    Computational complexity
    0 references