On the combinatorial and algebraic complexity of quantifier elimination

Authors:
S. Basu;R. Pollack;M.-F. Roy
Affiliations:
Dept. of Comput. Sci., Courant Inst. of Math. Sci., New York, NY, USA;-;-
Venue:
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Year:
1994

Citing 0
Cited 5

Learning from Approximate Data

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Learning Real Polynomials with a Turing Machine

ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Continuous First-Order Constraint Satisfaction

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Some lower bounds for the complexity of the linear programming feasibility problem over the reals

Journal of Complexity
Survey paper: Static output feedback-A survey

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

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, ...