Computational complexity of inclusion queries over polyhedral sets
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Jerzy Wojciechowski · International Symposium on Artificial Intelligence and Mathematics · 2012
In this paper we discuss the computational complexities of procedures for inclusion queries over polyhedral sets. The polyhedral sets that we consider occur in a wide range of applications, ranging from logistics to program verification. The goal of our study is to establish boundaries between hard and easy problems in this context.