scientific article

From MaRDI portal

Publication:3773366

Jump to:navigation, search

zbMath0634.68069MaRDI QIDQ3773366

Massimiliano Goldwurm, Nicoletta Sabadini, Alberto Bertoni

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity of computing parallel algorithm counting function context-free languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (8)

Ranking and formal power series ⋮ Parallel recognition and ranking of context-free languages ⋮ Counting problems and algebraic formal power series in noncommuting variables ⋮ On the complexity of ranking ⋮ Preface ⋮ A very hard log-space counting class ⋮ The complexity of ranking simple languages ⋮ Effective entropies and data compression

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3773366&oldid=17327486"