Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many perfect matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution of van der Waerden's problem for permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of permanent estimators for certain large matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents of d-dimensional matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive diagonal scaling of a nonnegative tensor to one with prescribed slice sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Random Determinants and Permanent Estimators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(t\)-wise balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: New permanental upper bounds for nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Minc's conjecture / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139974605 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing the Partition Function for Perfect Matchings in a Hypergraph
scientific article

    Statements

    Computing the Partition Function for Perfect Matchings in a Hypergraph (English)
    0 references
    0 references
    0 references
    8 December 2011
    0 references
    nearly perfect matchings in hypergraphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references