Complexity issues for the iterated h-preorders

DOI10.1007/978-3-030-93489-7_1MaRDI QIDQ2096579zbMATH OpenOpenAlexFDO

Authors P. E. Alaev, Victor Selivanov

Publication date 9 November 2022

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Classifying \(\omega\)-regular aperiodic \(k\)-partitions
• Complexity issues for preorders on finite labeled forests
• Non-collapse of the effective wadge hierarchy
• On the Wadge reducibility of \(k\)-partitions
• Polynomial-time versus recursive models
• Polynomially computable structures with finitely many generators
• Structures computable in polynomial time. I

Cited in

(2)

• scientific article; zbMATH DE number 7770056 (Why is no real title available?)
• Non-collapse of the effective Wadge hierarchy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096579)