Three efficient algorithms for counting problems
type: Item
instance of: scholarly article
title: Three efficient algorithms for counting problems
zbMATH Open document ID: 0404.68068
DOI: 10.1016/0020-0190(79)90093-0
author: Alberto Bertoni
author: Giancarlo Mauri
author: Mauro Torelli
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3628404
zbMATH Keywords: Efficient Algorithms for Counting Problems
zbMATH Keywords: Combinatorial Problems
zbMATH Keywords: Computational Complexity
zbMATH Keywords: Counting Strings
zbMATH Keywords: Counting Trees
zbMATH Keywords: Automata
zbMATH Keywords: Language
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90093-0
OpenAlex ID: W2049512207
Wikidata QID: Q57518731
cites work: On the computational power of pushdown automata
cites work: Q4140390
cites work: Q5526125
cites work: Automatic solution of a certain class of combinatorial problems
cites work: Q3250680
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: Q5585021
cites work: Q5639839
DBLP publication ID: journals/ipl/BertoniMT79
description: scientific article; zbMATH DE number 3628404