Author:
Bläser Markus,Curticapean Radu
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM Journal on Computing, 538–547 (2002)
2. Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8(2), 189–201 (1979)
3. Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics - an exact result. Philosophical Magazine 68(6), 1478–6435 (1961)
4. Kasteleyn, P.: The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice. Physica 27(12), 1209–1225 (1961)
5. Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31(2), 398–427 (2001)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献