Complexity of controlled bad sequences over finite sets of Nd

DOI10.1145/3373718.3394753zbMath1499.06006arXiv1909.01667OpenAlexW2978576973MaRDI QIDQ5145626

A. R. Balasubramanian

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.01667

zbMATH Keywords

well-quasi orderscontrolled bad sequencesmajoring and minoring ordering

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

Lower bounds on the state complexity of population protocols ⋮ Population protocols: beyond runtime analysis

This page was built for publication: Complexity of controlled bad sequences over finite sets of Nd