On the Computational Complexity of Problems Related to Distinguishability Sets

DOI10.1007/978-3-319-19225-3_10zbMath1390.68395OpenAlexW1130767423MaRDI QIDQ5500686

Sebastian Jakobi, Markus Holzer

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: On the Computational Complexity of Problems Related to Distinguishability Sets