Before revision:  Our novel learning algorithm constructs a consistent polytope as an intersection of about t \log t halfspaces  in time polynomial in t (where t is the number of halfspaces forming an optimal polytope).
After revision:  Our novel learning algorithm constructs a consistent polytope as an intersection of about t \log t halfspaces with margins in time polynomial in t (where t is the number of halfspaces forming an optimal polytope).