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 20172016201520142013
Arctic InterpretationCaTCaT
Match BoundsAProVE, CaT, TcTAProVE, CaT, TcT
Matrix Interpretation TriangularAProVE (N)AProVE (N)
Matrix Interpretation Non-Triangular CaT (N,R,Q),
TcT (N)
CaT (N,R,Q),
TcT (N)
Modular (Relative) Complexity AnalysisAProVE, CaT, TcTAProVE, CaT, TcT
Polynomial InterpretationsAProVE (N),
TcT (N)
AProVE (N),
TcT (N)
Polynomial Path OrdersTcT (sPOP*)TcT (sPOP*)
Rewriting Right Hand SidesAProVEAProVE
Root Labeling------
Weak Dependency PairsTcTTcT
Dependency TuplesAProVE, TcTAProVE, TcT
Path AnalysisTcTTcT
Weight Gap PrincipleCaT, TcTCaT, TcT
DG DecompositionTcTTcT