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

Runtime Complexity

next year or prev year

Method 201020092008
Arctic InterpretationCaTCaT, TcT---
Match BoundsCaT, TcTCaT, TcTTcT
Matrix Interpretation TriangularAProVE (N),
TcT (N)
CaT (N), TcT (N)TcT (N)
Matrix Interpretation Non-Triangular CaT (N,R,Q)------
Modular (Relative) Complexity AnalysisAProVE, CaTCaT---
Polynomial InterpretationsAProVE (N)------
Polynomial Path OrdersTcTTcTTcT
Rewriting Right Hand SidesAProVE------
Root Labeling---CaT, TcT---
Weak Dependency PairsTcTTcTTcT
Dependency TuplesAProVE------
Path AnalysisTcTTcTTcT
Weight Gap PrincipleCaT, TcTTcTTcT
DG Decomposition---------