Some NP-hard polygon decomposition problems (Q3967065): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56700239, #quickstatements; #temporary_batch_1706974288397 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some NP-hard polygon decomposition problems |
scientific article |
Statements
Some NP-hard polygon decomposition problems (English)
0 references
1983
0 references
computational complexity of polygon decomposition
0 references
computational geometry
0 references
syntactic pattern recognition
0 references
