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 20182017201620152014
Arctic InterpretationCaT
Match BoundsAProVE, CaT, TcT
Matrix Interpretation TriangularAProVE (N)
Matrix Interpretation Non-Triangular CaT (N,R,Q),
TcT (N)
Modular (Relative) Complexity AnalysisAProVE, CaT, TcT
Polynomial InterpretationsAProVE (N),
TcT (N)
Polynomial Path OrdersTcT (sPOP*)
Rewriting Right Hand SidesAProVE
Root Labeling---
Weak Dependency PairsTcT
Dependency TuplesAProVE, TcT
Path AnalysisTcT
Weight Gap PrincipleCaT, TcT
DG DecompositionTcT