Computational complexities of inclusion queries over polyhedral sets (Contributo in atti di convegno)

Type
Label
  • Computational complexities of inclusion queries over polyhedral sets (Contributo in atti di convegno) (literal)
Anno
  • 2012-01-01T00:00:00+01:00 (literal)
Alternative label
  • Eirinakis P., Ruggieri S., Subramani K., Wojciechowski P., (2012)
    Computational complexities of inclusion queries over polyhedral sets
    in International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, FL, USA, 9-11 January 2012
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Eirinakis P., Ruggieri S., Subramani K., Wojciechowski P., (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.cs.uic.edu/pub/Isaim2012/WebPreferences/ISAIM2012_Eirinakis_etal.pdf (literal)
Note
  • PuMa (literal)
  • Scopu (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • LDCSEE West Virginia University Morgantown, WV; Computer Science Department, University of Pisa, Italy; LDCSEE West Virginia University Morgantown, WV; LDCSEE, West Virginia University, USA (literal)
Titolo
  • Computational complexities of inclusion queries over polyhedral sets (literal)
Abstract
  • 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. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it