External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on