Author:
Börner Ferdinand,Bulatov Andrei,Jeavons Peter,Krokhin Andrei
Publisher
Springer Berlin Heidelberg
Reference38 articles.
1. Aspvall, B., Plass, M., Tarjan, R.: A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8, 121–123 (1979)
2. Lecture Notes in Computer Science;E. Böhler,2002
3. Börner, F., Krokhin, A., Bulatov, A., Jeavons, P.: Quantified constraints and surjective polymorphisms. Technical Report PRG-RR-02-11, Computing Laboratory, University of Oxford, UK (2002)
4. Bulatov, A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings of 43rd IEEE Symposium on Foundations of Computer Science, FOCS 2002, pp. 649–658 (2002)
5. Bulatov, A.: Mal’tsev constraints are tractable. Technical Report RR-02-05, Computing Laboratory, Oxford University (2002)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献