We prove that three preorders on the finite k-labeled forests are polynomial time computable. Together with an earlier result of the first author, this implies polynomial-time computability for an important initial segment of the corresponding degrees of discontinuity of k-partitions on the Baire space. Furthermore, we show that on ω-labeled forests the first of these three preorders is polynomial time computable as well while the other two preorders are NP-complete. © 2011 Springer-Verlag.
CITATION STYLE
Hertling, P., & Selivanov, V. (2011). Complexity issues for preorders on finite labeled forests. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6735 LNCS, pp. 112–121). https://doi.org/10.1007/978-3-642-21875-0_12
Mendeley helps you to discover research relevant for your work.