Fast monotone summation over disjoint sets (Q2446070): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3274591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Paths and Packings in Halves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of permanents in rings and semirings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monotone Summation over Disjoint Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of the Mobius transformation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation is Powerless for Boolean Slice Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding, minimizing, and counting weighted subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding heaviest <i>H</i> -subgraphs in real weighted graphs, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank

Latest revision as of 09:36, 8 July 2024

scientific article
Language Label Description Also known as
English
Fast monotone summation over disjoint sets
scientific article

    Statements

    Fast monotone summation over disjoint sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 April 2014
    0 references
    algorithms
    0 references
    arithmetic complexity
    0 references
    commutative semigroup
    0 references
    disjoint summation
    0 references
    \(k\)-path
    0 references
    matrix permanent
    0 references

    Identifiers