Author:
Geerts Floris,Kuijpers Bart
Reference47 articles.
1. Afrati, F., Cosmadakis, S., Grumbach, S., and Kuper, G. (1994). Linear versus polynomial constraints in database query languages. In Borning, A., editor, Proceedings of the 2nd Workshop on Principles and Practice of Constraint Programming, volume 874 of Lecture Notes in Computer Science, pages 181–192, Berlin. Springer-Verlag.
2. Andradas, C., Bröcker, L., and Ruiz, J. M. (1996). Constructible sets in real geometry, volume 33 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag.
3. Basu, S., Pollack, R., and Roy, M.-F. (2003a). Algorithms in real algebraic geometry, volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag.
4. Basu, S., Pollack, R., and Roy, M.-F. (2003b). Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag.
5. Belegradek, O. V., Stolboushkin, A. P., and Taitslin, M. A. (1996). On order-generic queries. Technical Report 96-01, DIMACS.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献