Input: | Polytope P given in H-description, polytope
Q given in V-description |
---|---|

Output: | "Yes" if P = Q, "No" otherwise |

Status (general): | Open; polynomial time if P is simple or
simplicial |
---|---|

Status (fixed dim.): | Polynomial time |

POLYTOPE VERIFICATION is strongly polynomially equivalent
to Problem 1 and Problem
2 (see the comments there).
POLYTOPE VERIFICATION is contained in Since it is easy to check whether |

Related problems: | 1, 2, 4 |
---|