The complexity of computing the permanent

This publication has 14 references indexed in Scilit:

• The polynomial-time hierarchy
  Theoretical Computer Science, 1976
• A lower bound on the number of additions in monotone computations
  Theoretical Computer Science, 1976
• A characterization of convertible (0, 1)-matrices
  Journal of Combinatorial Theory, Series B, 1975
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
  SIAM Journal on Computing, 1973
• A note on disjunctive form tautologies
  ACM SIGACT News, 1973
• The equivalence problem for regular expressions with squaring requires exponential space
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1972
• Gaussian elimination is not optimal
  Numerische Mathematik, 1969
• On the relation between the determinant and the permanent
  Illinois Journal of Mathematics, 1961
• An Algorithm for Distinct Representatives
  The American Mathematical Monthly, 1956
• 4. On a Class of Permanent Symmetric Functions
  Proceedings of the Royal Society of Edinburgh, 1882