Computational complexity of diagram satisfaction in Euclidean geometry (Q2489144)

From MaRDI portal
Revision as of 08:19, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2489144&oldid=26991044"
    Powered by MediaWiki