On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing Algebraic Formulas Using a Constant Number of Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Forbidden-Set Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Mechanics of Dimers on a Plane Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489221 / 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: Q4789198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant’s Algebraic Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer problem in statistical mechanics-an exact result / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank

Latest revision as of 02:40, 3 July 2024

scientific article
Language Label Description Also known as
English
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
scientific article

    Statements

    On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (English)
    0 references
    0 references
    0 references
    13 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    permanent
    0 references
    Hamiltonian
    0 references
    perfect matching
    0 references
    cycle cover
    0 references
    algebraic complexity
    0 references
    Valiant's model
    0 references
    topological pathwidth
    0 references
    weighted cliquewidth
    0 references
    0 references
    0 references