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 | 2010 | 2009 | 2008 | ||
|---|---|---|---|---|---|
| Arctic Interpretation | CaT, TcT | CaT, TcT | CaT, TcT | ||
| Match Bounds | CaT, TcT | CaT, TcT | CaT, TcT | ||
| Matrix Interpretation Triangular | TcT (N) | CaT (N), Matchbox (N), TcT (N) | TcT (N) | ||
| Matrix Interpretation Non-Triangular | CaT (N,R,Q), Matchbox (N) | --- | --- | ||
| Modular (Relative) Complexity Analysis | CaT | CaT | --- | ||
| Rewriting Right Hand Sides | --- | TcT | CaT | ||
| Root Labeling | CaT | CaT, TcT | CaT | ||
| Weight Gap Principle | CaT, TcT | CaT | --- |
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 |