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

Runtime Complexity

next year or prev year

Method 20232022202120202019
Arctic Interpretation
Match Bounds
Matrix Interpretation Triangular
Matrix Interpretation Non-Triangular
Modular (Relative) Complexity Analysis
Polynomial Interpretations
Polynomial Path Orders
Rewriting Right Hand Sides
Root Labeling
Weak Dependency Pairs
Dependency Tuples
Path Analysis
Weight Gap Principle
DG Decomposition