Page 77 - Textos de Matemática Vol. 39

ALGORITHM FOR K-MATCHINGS IN BIPARTITE GRAPHS 67 References
[1] A. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures Algorithms 14 (1999), 29-61.
[2] S. Friedland, A proof of a generalized van der Waerden conjecture on permanents, Linear Multilin. Algebra 11 (1982), 107-120.
[3] S. Friedland and L. Gurvits, Generalized Friedland-Tverberg inequality: applications and extensions, submitted.
[4] S. Friedland and U.N. Peled, The pressure associated with multidimensional SOFT, in preparation.
[5] S. Friedland, B. Rider and O. Zeitouni, Concentration of permanent estimators for certain large matrices, Annals of Applied Probability, 14(2004), 1559-1576.
[6] O.J. Heilman and E.H. Lieb, Theory of monomer-dimer systems, Comm. Math. Phys. 25 (1972), 190–232; Errata 27 (1972), 166.
[7] M. Jerrum, A. Sinclair and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, J. ACM 51 (2004), 671-697.
[8] L.G. Valiant, The complexity of computing the permanent, Theoretical Computer
Science 8 (1979), 189-201.
Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago
Chicago
Illinois 60607-7045, USA
E-mail address: friedlan@uic.edu
906 Kenbrook Court
Silver Spring
MD 20902, USA
E-mail address: dlevy@math.uic.edu