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.
Computational complexities of inclusion queries over polyhedral sets
Ruggieri S;
2012
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_276082-doc_78208.pdf
solo utenti autorizzati
Descrizione: Computational complexities of inclusion queries over polyhedral sets
Tipologia:
Versione Editoriale (PDF)
Dimensione
289.56 kB
Formato
Adobe PDF
|
289.56 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
