Ranking and formal power series

DOI10.1016/0304-3975(91)90144-QzbMath0721.68023MaRDI QIDQ2641104

Danilo Bruschi, Massimiliano Goldwurm, Alberto Bertoni

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

rankingparallel complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions ⋮ Rational transductions and complexity of counting problems ⋮ Rational transductions and complexity of counting problems ⋮ Preface ⋮ Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series ⋮ The complexity of computing maximal word functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting problems and algebraic formal power series in noncommuting variables
• On uniform circuit complexity
• A taxonomy of problems with fast parallel algorithms
• Logarithmic Depth Circuits for Algebraic Functions
• Log Depth Circuits for Division and Related Problems