On efficient computation of the coefficients of some polynomials with applications to some enumeration problems (Q1152953): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three efficient algorithms for counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank

Latest revision as of 11:27, 13 June 2024

scientific article
Language Label Description Also known as
English
On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
scientific article

    Statements

    On efficient computation of the coefficients of some polynomials with applications to some enumeration problems (English)
    0 references
    1981
    0 references
    random access machine
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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