Computational complexity of diagram satisfaction in Euclidean geometry (Q2489144)

From MaRDI portal
Revision as of 14:06, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    Computational complexity of diagram satisfaction in Euclidean geometry (English)
    0 references
    author
    Nathaniel Miller
    0 references
    publication date
    16 May 2006
    0 references
    zbMATH DE Number
    5023429
    0 references
    zbMATH Keywords
    Euclidean geometry
    0 references
    Diagrams
    0 references
    Computational complexity
    0 references
    OpenAlex ID
    W2048639138
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2489144&oldid=34871293"
    Powered by MediaWiki