Complexity issues for the iterated \(h\)-preorders
type: Item
instance of: scholarly article
title: Complexity issues for the iterated \(h\)-preorders
DOI: 10.1007/978-3-030-93489-7_1
author: P. E. Alaev
author: Victor Selivanov
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7614737
zbMATH Keywords: preorder
zbMATH Keywords: labeled forest
zbMATH Keywords: iterated \(h\)-preorder
zbMATH Keywords: structure
zbMATH Keywords: polynomial-time presentation
MaRDI profile type: Publication
full work available at URL: 978-3-030-93489-7 1
OpenAlex ID: W4205721249
cites work: Q4091421
cites work: Structures computable in polynomial time. I
cites work: Polynomially computable structures with finitely many generators
cites work: Polynomial-time versus recursive models
cites work: Q4982348
cites work: Classifying \(\omega\)-regular aperiodic \(k\)-partitions
cites work: On the Wadge Reducibility of k-Partitions
cites work: Non-collapse of the effective wadge hierarchy
description: scientific article; zbMATH DE number 7614737