Download:
|
by B. Codenotti, G. Resta
http://www.imc.pi.cnr.it/~codenotti/ps_files/genus.ps
Add To MetaCart
Abstract:
Computation of sparse circulant permanents via determinants
Citations
|
324
|
The complexity of computing the permanent
– Valiant
- 1979
|
|
313
|
Matching Theory
– Lovász, Plummer
- 1986
|
|
67
|
The statistics of dimers on a lattice, I. The number of dimer arrangements on a quadratic lattice, Physica 27
– Kasteleyn
- 1961
|
|
63
|
Completeness Classes in Algebra
– Valiant
- 1979
|
|
46
|
Dimer statistics and phase transitions
– Kasteleyn
- 1963
|
|
29
|
On the hardness of computing the permanent of random matrices
– Feige, Lund
- 1997
|
|
11
|
Matchings in graphs on non-orientable surfaces
– Tesler
- 2000
|
|
8
|
A combinatorial solution of the two-dimensional Ising model
– Kac, Ward
- 1952
|
|
7
|
Permanental Compounds and Permanents of (0; 1) Circulants. Linear Algebra and its Appl
– Minc
- 1987
|
|
6
|
Permanents, Pfaan orientations, and even directed circuits (Extended abstract
– Robertson, Seymour, et al.
- 1999
|
|
5
|
Aufgabe 424
– Pólya
- 1913
|
|
4
|
How fast can one compute the permanent of circulant matrices?', Linear Algebra and its
– Bernasconi, Codenotti, et al.
- 1999
|
|
4
|
Graph Theory and Crystal
– Kasteleyn
- 1967
|
|
3
|
On the Theory of Pfaan Orientations
– Galluccio, Loebl
- 1999
|
|
3
|
Recurrence Formulas for Permanents of (0; 1) Circulants. Linear Algebra and its Appl
– Minc
- 1985
|
|
2
|
On the Permanent of Certain (0,1) Toeplitz Matrices. Linear Algebra and its Applications, accepted for publication
– Codenotti, Crespi, et al.
- 1997
|
