Computational complexity of diagram satisfaction in Euclidean geometry (Q2489144)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5023429
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of diagram satisfaction in Euclidean geometry |
scientific article; zbMATH DE number 5023429 |
Statements
Computational complexity of diagram satisfaction in Euclidean geometry (English)
0 references
16 May 2006
0 references
Euclidean geometry
0 references
Diagrams
0 references
Computational complexity
0 references
0 references
0.7663953900337219
0 references
0.7425867319107056
0 references
0.7355548143386841
0 references
