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 20222021202020192018
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