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 2008
Arctic InterpretationCaT, TcT
Match BoundsCaT, TcT
Matrix Interpretation TriangularTcT (N)
Matrix Interpretation Non-Triangular ---
Modular (Relative) Complexity Analysis---
Rewriting Right Hand SidesCaT
Root LabelingCaT
Weight Gap Principle---

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