The Complexity of Computing the Permanent

[1]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[2]  Janos Simon,et al.  On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.

[3]  Adi Shamir,et al.  On Digital Signatures and Public-Key Cryptosystems. , 1977 .

[4]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[5]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[6]  Claus-Peter Schnorr,et al.  A Lower Bound on the Number of Additions in Monotone Computations , 1976, Theor. Comput. Sci..

[7]  Juris Hartmanis,et al.  On isomorphisms and density of NP and other complete sets , 1976, STOC '76.

[8]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[9]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[10]  C. Little.  A characterization of convertible (0, 1)-matrices , 1975 .

[11]  Steven Roman,et al.  A Problem of Zarankiewicz , 1975, J. Comb. Theory, Ser. A.

[12]  Janos Simon.  On some central problems in computational complexity , 1975 .

[13]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[14]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[15]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[16]  M. Paterson,et al.  A note on disjunctive form tautologies , 1973, SIGA.

[17]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[18]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[19]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[20]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[21]  M. Marcus,et al.  On the relation between the determinant and the permanent , 1961 .

[22]  Marshall Hall,et al.  An Algorithm for Distinct Representatives , 1956 .

[23]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[24]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[25]  T. Muir.  4. On a Class of Permanent Symmetric Functions , .