Computational complexity of inclusion queries over polyhedral sets

Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr J. Wojciechowski. Computational complexity of inclusion queries over polyhedral sets. In International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11, 2012. 2012. [doi]

@inproceedings{EirinakisRSW12-0,
  title = {Computational complexity of inclusion queries over polyhedral sets},
  author = {Pavlos Eirinakis and Salvatore Ruggieri and K. Subramani and Piotr J. Wojciechowski},
  year = {2012},
  url = {http://www.cs.uic.edu/pub/Isaim2012/WebPreferences/ISAIM2012_Eirinakis_etal.pdf},
  researchr = {https://researchr.org/publication/EirinakisRSW12-0},
  cites = {0},
  citedby = {0},
  booktitle = {International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11, 2012},
}