Techniques
This page is for listing all techniques applied by the participants of the complexity competitions.
Be aware: the lists are still preliminary.
Derivational Complexity
| Method | 2025 | 2024 | 2023 | 2022 | 2021 |
|---|---|---|---|---|---|
| Arctic Interpretation | |||||
| Match Bounds | |||||
| Matrix Interpretation Triangular | |||||
| Matrix Interpretation Non-Triangular | |||||
| Modular (Relative) Complexity Analysis | |||||
| Rewriting Right Hand Sides | |||||
| Root Labeling | |||||
| Weight Gap Principle |
Runtime Complexity
| Method | 2009 | 2008 | |||
|---|---|---|---|---|---|
| Arctic Interpretation | CaT, TcT | --- | |||
| Match Bounds | CaT, TcT | TcT | |||
| Matrix Interpretation Triangular | CaT (N), TcT (N) | TcT (N) | |||
| Matrix Interpretation Non-Triangular | --- | --- | |||
| Modular (Relative) Complexity Analysis | CaT | --- | |||
| Polynomial Interpretations | --- | --- | |||
| Polynomial Path Orders | TcT | TcT | |||
| Rewriting Right Hand Sides | --- | --- | |||
| Root Labeling | CaT, TcT | --- | |||
| Weak Dependency Pairs | TcT | TcT | |||
| Dependency Tuples | --- | --- | |||
| Path Analysis | TcT | TcT | |||
| Weight Gap Principle | TcT | TcT | |||
| DG Decomposition | --- | --- |