Complexity issues for the iterated \(h\)-preorders

DOI10.1007/978-3-030-93489-7_1OpenAlexW4205721249MaRDI QIDQ2096579

P. E. Alaev, Victor L. Selivanov

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93489-7_1

zbMATH Keywords

preorderstructurelabeled forestiterated \(h\)-preorderpolynomial-time presentation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Non-collapse of the effective Wadge hierarchy ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial-time versus recursive models
• Classifying \(\omega\)-regular aperiodic \(k\)-partitions
• Non-collapse of the effective wadge hierarchy
• Polynomially computable structures with finitely many generators
• Structures computable in polynomial time. I
• On the Wadge Reducibility of k-Partitions

This page was built for publication: Complexity issues for the iterated \(h\)-preorders