Computation of sparse circulant permanents via determinants (Q1855364): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How fast can one compute the permanent of circulant matrices? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the permanent of certain \((0,1)\) Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of Pfaffian orientations. I: Perfect matchings and permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization via enumeration: A new algorithm for the max cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Solution of the Two-Dimensional Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence formulas for permanents of (0,1)-circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanental compounds and permanents of (0,1)-circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the Ising model on group lattices of genus <i>g</i>&amp;gt;1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and topological approach to the 3D Ising model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in graphs on non-orientable surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank

Latest revision as of 11:17, 5 June 2024

scientific article
Language Label Description Also known as
English
Computation of sparse circulant permanents via determinants
scientific article

    Statements

    Computation of sparse circulant permanents via determinants (English)
    0 references
    5 February 2003
    0 references
    permanent
    0 references
    circulant matrices
    0 references
    perfect matchings
    0 references
    genus
    0 references
    determinants
    0 references
    0 references
    0 references

    Identifiers