Set constraints with projections are in NEXPTIME
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 642-653
- https://doi.org/10.1109/sfcs.1994.365727
Abstract
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, ...Keywords
This publication has 14 references indexed in Scilit:
- Logical aspects of set constraintsPublished by Springer Nature ,2006
- Solving systems of set constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Solving systems of set constraints with negated subset relationshipsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Systems of set constraints with negative constraints are NEXPTIME-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A decision procedure for a class of set constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Static type inference in a dynamically typed languagePublished by Association for Computing Machinery (ACM) ,1991
- Implementing regular tree expressionsPublished by Springer Nature ,1991
- A finite presentation theorem for approximating logic programsPublished by Association for Computing Machinery (ACM) ,1990
- Declaration-free type checkingPublished by Association for Computing Machinery (ACM) ,1985
- Flow analysis and optimization of LISP-like structuresPublished by Association for Computing Machinery (ACM) ,1979