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 20162015201420132012
Arctic InterpretationCaTCaTCaT
Match BoundsCaT, TcTCaT, TcTCaT, TcT
Matrix Interpretation Triangular---------
Matrix Interpretation Non-Triangular CaT (N,R,Q),
TcT (N)
CaT (N,R,Q),
TcT (N)
CaT (N,R,Q),
TcT (N)
Modular (Relative) Complexity AnalysisCaT, TcTCaT, TcTCaT, TcT
Rewriting Right Hand Sides---------
Root LabelingCaTCaTCaT
Weight Gap PrincipleCaT, TcTCaT, TcTCaT, TcT

Runtime Complexity

next year or prev year

Method 2008
Arctic Interpretation---
Match BoundsTcT
Matrix Interpretation TriangularTcT (N)
Matrix Interpretation Non-Triangular ---
Modular (Relative) Complexity Analysis---
Polynomial Interpretations---
Polynomial Path OrdersTcT
Rewriting Right Hand Sides---
Root Labeling---
Weak Dependency PairsTcT
Dependency Tuples---
Path AnalysisTcT
Weight Gap PrincipleTcT
DG Decomposition---