Complexity issues for the iterated h-preorders

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

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

• Title not available (Why is that?)
• Polynomial-time versus recursive models
• Structures computable in polynomial time. I
• On the Wadge reducibility of \(k\)-partitions
• Classifying \(\omega\)-regular aperiodic \(k\)-partitions
• Non-collapse of the effective wadge hierarchy
• Polynomially computable structures with finitely many generators
• Complexity issues for preorders on finite labeled forests

Cited In (2)

• Title not available (Why is that?)
• 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)