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 | 2020 | 2019 | 2018 | 2017 | 2016 |
|---|---|---|---|---|---|
| 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 | 2018 | 2017 | 2016 | 2015 | 2014 |
|---|---|---|---|---|---|
| Arctic Interpretation | CaT | ||||
| Match Bounds | AProVE, CaT, TcT | ||||
| Matrix Interpretation Triangular | AProVE (N) | ||||
| Matrix Interpretation Non-Triangular | CaT (N,R,Q), TcT (N) | ||||
| Modular (Relative) Complexity Analysis | AProVE, CaT, TcT | ||||
| Polynomial Interpretations | AProVE (N), TcT (N) | ||||
| Polynomial Path Orders | TcT (sPOP*) | ||||
| Rewriting Right Hand Sides | AProVE | ||||
| Root Labeling | --- | ||||
| Weak Dependency Pairs | TcT | ||||
| Dependency Tuples | AProVE, TcT | ||||
| Path Analysis | TcT | ||||
| Weight Gap Principle | CaT, TcT | ||||
| DG Decomposition | TcT |