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 | 2011 | 2010 | 2009 | 2008 | |
|---|---|---|---|---|---|
| Arctic Interpretation | CaT | CaT, TcT | CaT, TcT | CaT, TcT | |
| Match Bounds | CaT, TcT | CaT, TcT | CaT, TcT | CaT, TcT | |
| Matrix Interpretation Triangular | TcT (N) | TcT (N) | CaT (N), Matchbox (N), TcT (N) | TcT (N) | |
| Matrix Interpretation Non-Triangular | CaT (N,R,Q), Matchbox (N) | CaT (N,R,Q), Matchbox (N) | --- | --- | |
| Modular (Relative) Complexity Analysis | CaT | CaT | CaT | --- | |
| Rewriting Right Hand Sides | --- | --- | TcT | CaT | |
| Root Labeling | CaT | CaT | CaT, TcT | CaT | |
| Weight Gap Principle | CaT, TcT | CaT, TcT | CaT | --- |
Runtime Complexity
| Method | 2022 | 2021 | 2020 | 2019 | 2018 |
|---|---|---|---|---|---|
| Arctic Interpretation | |||||
| Match Bounds | |||||
| Matrix Interpretation Triangular | |||||
| Matrix Interpretation Non-Triangular | |||||
| Modular (Relative) Complexity Analysis | |||||
| Polynomial Interpretations | |||||
| Polynomial Path Orders | |||||
| Rewriting Right Hand Sides | |||||
| Root Labeling | |||||
| Weak Dependency Pairs | |||||
| Dependency Tuples | |||||
| Path Analysis | |||||
| Weight Gap Principle | |||||
| DG Decomposition |