Generating All Vertices of a Polyhedron Is Hard

Leonid Khachiyan, E. B., Borys, K., Elbassioni, K., & Gurvich, V. (2008). Generating All Vertices of a Polyhedron Is Hard.

Type

Unclassified

Intellectual base

Unclassified

Year

2008

DOI

10.1007/s00454-008-9050-5

Link

https://doi.org/10.1007/s00454-008-9050-5

Cited by

1 citation across 1 artifact.

Domain-specific

• Vertex enumeration problem
  • Complexity must be measured against both input and potentially exponential output, degeneracy and unboundedness change algorithms and facet enumeration is the dual conversion direction.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:8f5080df2330 · see in the full table