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

Runtime Complexity

next year or prev year

Method 20212020201920182017
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