Three efficient algorithms for counting problems

DOI10.1016/0020-0190(79)90093-0MaRDI QIDQ1256858zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alberto Bertoni, Giancarlo Mauri, Mauro Torelli

Publication date 1979

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

Full work available at URL https://doi.org/10.1016/0020-0190(79)90093-0

zbMATH Keywords

AutomataLanguageCombinatorial ProblemsComputational ComplexityCounting StringsCounting TreesEfficient Algorithms for Counting Problems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Artificial intelligence (68T99)

Cites work

• scientific article; zbMATH DE number 3134390 (Why is no real title available?)
• scientific article; zbMATH DE number 3569839 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Automatic solution of a certain class of combinatorial problems
• Initial Algebra Semantics and Continuous Algebras
• On the computational power of pushdown automata

Cited in

(2)

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

This page was built for publication: Three efficient algorithms for counting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1256858)