This page is for listing all techniques applied by the participants of the complexity competitions.

Be aware: the lists are still preliminary.

Derivational Complexity

next year or prev year

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

next year or prev year

Method	2008
Arctic Interpretation	---
Match Bounds	TcT
Matrix Interpretation Triangular	TcT (N)
Matrix Interpretation Non-Triangular	---
Modular (Relative) Complexity Analysis	---
Polynomial Interpretations	---
Polynomial Path Orders	TcT
Rewriting Right Hand Sides	---
Root Labeling	---
Weak Dependency Pairs	TcT
Dependency Tuples	---
Path Analysis	TcT
Weight Gap Principle	TcT
DG Decomposition	---