Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Computational complexity of inclusion queries over polyhedral sets."

Pavlos Eirinakis et al. (2012)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2024-03-20

- view
  - electronic edition @ uic.edu (archived)
- export record
  dblp key:
  - conf/isaim/EirinakisRSW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaim/EirinakisRSW12
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski:
Computational complexity of inclusion queries over polyhedral sets. ISAIM 2012

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.