Computational complexity of diagram satisfaction in Euclidean geometry (Q2489144): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3234138 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862379 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3438379 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5807665 / rank | |||
Normal rank | |||
Latest revision as of 14:06, 24 June 2024
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
16 May 2006
0 references
Euclidean geometry
0 references
Diagrams
0 references
Computational complexity
0 references
0 references
