Q5009467 (Q5009467): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the number of linear extensions of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using TPA to count linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree decompositions with small cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket elimination: A unifying framework for reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Linear Extensions: Parameterizations by Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Library for Number Theory: An Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical hardness models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5283021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Rank Tests and Semigraphoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Partial-Order Plan Relaxation via MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2810856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in minimum-comparison sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bit-complexity of sparse polynomial and series multiplication / rank
 
Normal rank

Revision as of 07:45, 26 July 2024

scientific article; zbMATH DE number 7378591
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378591

    Statements

    0 references
    0 references
    0 references
    4 August 2021
    0 references
    algorithm selection
    0 references
    empirical hardness
    0 references
    linear extension
    0 references
    multiplication of polynomials
    0 references
    tree decomposition
    0 references
    0 references
    0 references

    Identifiers