Computational complexity of diagram satisfaction in Euclidean geometry (Q2489144): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jco.2005.09.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048639138 / rank | |||
Normal rank | |||
Revision as of 23:32, 19 March 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
