|Input:||Face Lattice of a polytope P|
|Output:||"Yes" if P is isomorphic to its dual, "No" otherwise|
|Status (fixed dim.):||Polynomial time|
This is a special case of problem 22. In
particular, it is solvable in polynomial time in bounded
It is easy to see that deciding whether a general 0/1-matrix A (not necessarily a vertex-facet incidence matrix of a polytope) can be transformed into AT by permuting its rows and columns is graph isomorphism complete.