Theoretical Computer Science

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

next year or prev year

Method 2008
Arctic InterpretationCaT, TcT
Match BoundsCaT, TcT
Matrix Interpretation TriangularTcT (N)
Matrix Interpretation Non-Triangular ---
Modular (Relative) Complexity Analysis---
Rewriting Right Hand SidesCaT
Root LabelingCaT
Weight Gap Principle---

Runtime Complexity

next year or prev year

Method 2011201020092008
Arctic InterpretationCaTCaTCaT, TcT---
Match BoundsCaT, TcTCaT, TcTCaT, TcTTcT
Matrix Interpretation TriangularAProVE (N),
TcT (N)
AProVE (N),
TcT (N)
CaT (N), TcT (N)TcT (N)
Matrix Interpretation Non-Triangular CaT (N,R,Q)CaT (N,R,Q)------
Modular (Relative) Complexity AnalysisAProVE, CaTAProVE, CaTCaT---
Polynomial InterpretationsAProVE (N)AProVE (N)------
Polynomial Path OrdersTcTTcTTcTTcT
Rewriting Right Hand SidesAProVEAProVE------
Root Labeling------CaT, TcT---
Weak Dependency PairsTcTTcTTcTTcT
Dependency TuplesAProVE, TcTAProVE------
Path AnalysisTcTTcTTcTTcT
Weight Gap PrincipleCaT, TcTCaT, TcTTcTTcT
DG Decomposition------------