Pages that link to "Item:Q1129003"
From MaRDI portal
The following pages link to Ordinal recursive bounds for Higman's theorem (Q1129003):
Displaying 8 items.
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- Nondeterministic Ordered Restarting Automata (Q3177341) (← links)
- Higman’s Lemma and Its Computational Content (Q3305561) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
