The Complexity of the Evaluation of Complex Algebra Expressions
β Scribed by Dan Suciu; Jan Paredaens
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 860 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
The Abiteboul and Beeri algebra for complex objects can express a query whose meaning is transitive closure, but the algorithm naturally associated to this query needs exponential space. We show that any other query in the algebra which expresses transitive closure needs exponential space, under a ``call by value'' evaluation strategy. This proves that in general the powerset is an intractable operator for implementing fixpoint queries. ] 1997 Academic Press possible results which one can get by applying a relational algebra expression to r n and show that none of them is the transitive closure. Here, we identify a set of possible complex object results which one can get by applying a complex article no.
π SIMILAR VOLUMES
The surjectivity of the exponential function of complex algebraic, in particular of complex semisimple Lie groups, and of complex splittable Lie groups is equivalent to the connectedness of the centralizers of the nilpotent elements in the Lie algebra. This implies that the only complex semisimple L
In this paper we present two methods of computing with complex algebraic numbers. The first uses isolating rectangles to distinguish between the roots of the minimal polynomial, the second method uses validated numeric approximations. We present algorithms for arithmetic and for solving polynomial e