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]

Authors

Pavlos Eirinakis

This author has not been identified. Look up 'Pavlos Eirinakis' in Google

Salvatore Ruggieri

This author has not been identified. Look up 'Salvatore Ruggieri' in Google

K. Subramani

This author has not been identified. Look up 'K. Subramani' in Google

Piotr J. Wojciechowski

This author has not been identified. Look up 'Piotr J. Wojciechowski' in Google