Pages that link to "Item:Q5612466"
From MaRDI portal
The following pages link to Hierarchies of number-theoretic functions. I (Q5612466):
Displaying 23 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete (Q344560) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Some rapidly growing functions (Q1148900) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Increase of the complexity of functions by an application of multiple recursion (Q1245948) (← links)
- Dickson's lemma and weak Ramsey theory (Q1734268) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- The intrinsic difficulty of recursive functions (Q1919986) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) (← links)
- Relating timed and register automata (Q2971073) (← links)
- The Strength of the SCT Criterion (Q2988827) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- A Combinatorial Bound for a Restricted Form of the Termination Theorem (Q3295155) (← links)
- Built-up systems of fundamental sequences and hierarchies of number-theoretic functions (Q4133629) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- The Ackermann functions are not optimal, but by how much? (Q5190202) (← links)
- Zeno, Hercules, and the Hydra (Q5277917) (← links)
- Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy (Q5676207) (← links)
- Long finite sequences (Q5940305) (← links)