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