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

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