Author:
Bodirsky Manuel,Mamino Marcello,Viola Caterina
Publisher
Springer International Publishing
Reference21 articles.
1. Bodirsky, M., Grohe, M.: Non-dichotomies in constraint satisfaction complexity. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), pp. 184–196. Springer, Berlin (2008). https://doi.org/10.1007/978-3-540-70583-3_16
2. Bodirsky, M., Mamino, M.: Constraint satisfaction problems over numeric domains. In: Krokhin, A., Zivny, S. (eds.) The Constraint Satisfaction Problem: Complexity and Approximability, vol. 7, pp. 79–111. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2017). http://drops.dagstuhl.de/opus/volltexte/2017/6958
3. Bulatov, A.A.: A dichotomy theorem for nonuniform CSPs. In: Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS), Berkeley, pp. 319–330. (2017). https://ieeexplore.ieee.org/document/8104069
4. Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the 20th ACM Annual Symposium on Theory of Computing (STOC), pp. 460–467. ACM, New York (1988). https://doi.org/10.1145/62212.62257
5. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition: a synopsis. SIGSAM Bull. 10(1), 10–12 (1976). https://doi.org/10.1145/1093390.1093393