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 20092008
Arctic InterpretationCaT, TcTCaT, TcT
Match BoundsCaT, TcTCaT, TcT
Matrix Interpretation TriangularCaT (N),
Matchbox (N),
TcT (N)
TcT (N)
Matrix Interpretation Non-Triangular ------
Modular (Relative) Complexity AnalysisCaT---
Rewriting Right Hand SidesTcTCaT
Root LabelingCaT, TcTCaT
Weight Gap PrincipleCaT---

Runtime Complexity

next year or prev year

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