Subject
General Computer Science,Theoretical Computer Science
Reference28 articles.
1. The complexity of computing the permanent;Valiant;Theoret. Comput. Sci.,1979
2. Zero-one permanent is #P-complete, a simpler proof;Ben-Dor,1993
3. Dimer problem in statistical mechanics – an exact result;Temperley;Philos. Mag.,1961
4. The statistics on dimers on a lattice: 1. The number of dimer arrangements on a quadratic lattice;Kasteleyn;Physica,1961
5. Accidental algorithms;Valiant,2006