On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
type: Item
instance of: scholarly article
title: On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
zbMATH Open document ID: 0462.68027
DOI: 10.1016/0020-0190(81)90113-7
published in: Information Processing Letters
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3723862
zbMATH Keywords: random access machine
Wikidata QID: Q57518727
author: Alberto Bertoni
author: Giancarlo Mauri
MaRDI profile type: Publication
full work available at URL: 0020-0190(81)90113-7
OpenAlex ID: W2019687458
cites work: Q4773298
cites work: Q4140390
cites work: Three efficient algorithms for counting problems
cites work: Q4190138
cites work: Q3923597
cites work: Combinatorial methods
cites work: Q4155837
cites work: The complexity of computing the permanent
description: scientific article; zbMATH DE number 3723862