The Complexity of Enumeration and Reliability Problems

This publication has 12 references indexed in Scilit:

• The complexity of computing the permanent
  Theoretical Computer Science, 1979
• Cliques of a graph-variations on the Bron-Kerbosch algorithm
  International Journal of Parallel Programming, 1976
• A characterization of convertible (0, 1)-matrices
  Journal of Combinatorial Theory, Series B, 1975
• Algorithm 457: finding all cliques of an undirected graph
  Communications of the ACM, 1973
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• Permanents
  The American Mathematical Monthly, 1965
• Dimer Statistics and Phase Transitions
  Journal of Mathematical Physics, 1963
• On the relation between the determinant and the permanent
  Illinois Journal of Mathematics, 1961
• Dimer problem in statistical mechanics-an exact result
  Philosophical Magazine, 1961
• 4. On a Class of Permanent Symmetric Functions
  Proceedings of the Royal Society of Edinburgh, 1882