Complexity Bounds for Ordinal-Based Termination

DOI10.1007/978-3-319-11439-2_1zbMath1448.68318arXiv1407.5896OpenAlexW137988827MaRDI QIDQ3447691

Sylvain Schmitz

Publication date: 28 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

ranking functionwell-quasi-orderfast-growing complexitylength-function theoremRamsey-based termination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Recursive ordinals and ordinal notations (03F15)

Related Items (2)

Size-based termination of higher-order rewriting ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings

This page was built for publication: Complexity Bounds for Ordinal-Based Termination