论文信息 - ON THE PERMANENT OF CERTAIN (0, 1) TOEPLITZ MATRICES - 字舞流文

ON THE PERMANENT OF CERTAIN (0, 1) TOEPLITZ MATRICES

Bruno Codenotti | Giovanni Resta | Valentino Crespi | B. Codenotti | V. Crespi | G. Resta

[1] Carsten Lund,et al. On the hardness of computing the permanent of random matrices , 1996, STOC '92.

[2] Zvi Galil,et al. Proceedings of the 30th IEEE symposium on Foundations of computer science , 1994, FOCS 1994.

[3] R. Brualdi,et al. Combinatorial Matrix Theory , 1991 .

[4] Vijay V. Vazirani,et al. NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems , 1989, Inf. Comput..

[5] M. Luby,et al. Polytopes, permanents and graphs with large factors , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[6] Henryk Minc,et al. Permanental compounds and permanents of (0, 1)-circulants , 1987 .

[7] Paul D. Seymour,et al. Characterization of even directed graphs , 1987, J. Comb. Theory, Ser. B.

[8] Henryk Minc,et al. Recurrence formulas for permanents of (0, 1)-circulants , 1985 .

[9] Leslie G. Valiant,et al. Completeness classes in algebra , 1979, STOC.

[10] N. Metropolis,et al. Permanents of cyclic (0,1) matrices , 1969 .

[11] John Maybee,et al. Qualitative Economics and the Scope of the Correspondence Principle , 1968 .

[12] Richard A. Brualdi,et al. Matrices of sign-solvable linear systems: Master bibliography , 1995 .

[13] Michael Doob,et al. Spectra of graphs , 1980 .

[14] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..