Fundamentals of Computation Theory

DOI10.1007/11537311zbMath1122.68441OpenAlexW2491671784MaRDI QIDQ5492933

Beate Bollig

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11537311

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs ⋮ Proofs of proximity for context-free languages and read-once branching programs ⋮ Length of polynomials over finite groups

This page was built for publication: Fundamentals of Computation Theory