Author:
Briquel Irénée,Koiran Pascal
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Bürgisser, P.: On the structure of Valiant’s complexity classes. Discrete Mathematics and Theoretical Computer Science 3, 73–94 (1999)
2. Algorithms and Computation in Mathematics;P. Bürgisser,2000
3. Briquel, I., Koiran, P.: A dichotomy theorem for polynomial evaluation, http://prunel.ccsd.cnrs.fr/ensl-00360974
4. Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM 53(1), 66–120 (2006)
5. Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Information and Computation 125, 1–12 (1996)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献