Pages that link to "Item:Q1803270"
From MaRDI portal
The following pages link to Probing polygons minimally is hard (Q1803270):
Displaying 6 items.
- A note on data structures for maintaining bipartitions (Q924550) (← links)
- Testing geometric objects (Q1328754) (← links)
- Testing simple polygons. (Q2482903) (← links)
- Exact Learning of Discretized Geometric Concepts (Q4210170) (← links)
- Decision Trees for Geometric Models (Q4513214) (← links)
- Data structures for maintaining set partitions (Q4810507) (← links)