  In this paper we characterize the slack matrices of cones and polytopes among
all nonnegative matrices. This leads to an algorithm for deciding whether a
given matrix is a slack matrix. The underlying decision problem is equivalent
to the polyhedral verification problem whose complexity is unknown.
