On efficient computation of the coefficients of some polynomials with applications to some enumeration problems

DOI10.1016/0020-0190(81)90113-7zbMath0462.68027OpenAlexW2019687458WikidataQ57518727 ScholiaQ57518727MaRDI QIDQ1152953

Giancarlo Mauri, Alberto Bertoni

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90113-7

zbMATH Keywords

random access machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Determinants, permanents, traces, other special matrix functions (15A15) Formal languages and automata (68Q45)

Related Items (2)

Preface ⋮ A note on the power of integer division

Cites Work

• The complexity of computing the permanent
• Three efficient algorithms for counting problems
• Combinatorial methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On efficient computation of the coefficients of some polynomials with applications to some enumeration problems