Complexity issues for preorders on finite labeled forests

Authors:
Peter Hertling;Victor Selivanov
Affiliations:
Institut für Theoretische Informatik, Mathematik und Operations Research, Universität der Bundeswehr München, Neubiberg, Germany;A.P. Ershov Institute of Informatics Systems, Novosibirsk, Russia
Venue:
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Year:
2011

Citing 11
Cited 0

Structural complexity 1

Structural complexity 1
Structural complexity 2

Structural complexity 2
Computable analysis: an introduction

Computable analysis: an introduction
The Boolean Hierarchy of NP-Partitions

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems

Theory of Computing Systems
Labeled posets are universal

European Journal of Combinatorics
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests

Journal of Logic and Computation
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Undecidability in Weihrauch degrees

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Undecidability in the homomorphic quasiorder of finite labeled forests

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.