Polynomial inequalities representing polyhedra

Our main result is that every ro-dimensional polytope can be described by at most (2n — 1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound 2n — 2 and for arbitrary polyhedra we get a constructible representation by 2n polynomial inequalities