Author:
Bläser Markus,Dell Holger,Makowsky Johann A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference25 articles.
1. Averbouch, I., Makowsky, J.A.: The complexity of multivariate matching polynomials. Preprint (January 2007)
2. Lecture Notes in Computer Science;I. Averbouch,2008
3. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (Philadelphia, Pennsylvania, USA, October 25–28, 2008), pp. 677–686 (2008)
4. Lecture Notes in Computer Science;M. Bläser,2007
5. Bläser, M., Hoffmann, C.: On the complexity of the interlace polynomial. 0707.4565 (2007)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献