A lower bound for the complexity of linear optimization from a quantifier-elimination point of view.

Rafael Grimson A lower bound for the complexity of linear optimization from a quantifier-elimination point of view. 2007 Constraint Databases, Geometric Elimination and Geographic Information Systems http://drops.dagstuhl.de/opus/volltexte/2007/1283 conf/dagstuhl/2007P7212 db/conf/dagstuhl/P7212.html#Grimson07