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 20232022202120202019
Arctic Interpretation
Match Bounds
Matrix Interpretation Triangular
Matrix Interpretation Non-Triangular
Modular (Relative) Complexity Analysis
Rewriting Right Hand Sides
Root Labeling
Weight Gap Principle

Runtime Complexity

next year or prev year

Method 20092008
Arctic InterpretationCaT, TcT---
Match BoundsCaT, TcTTcT
Matrix Interpretation TriangularCaT (N), TcT (N)TcT (N)
Matrix Interpretation Non-Triangular ------
Modular (Relative) Complexity AnalysisCaT---
Polynomial Interpretations------
Polynomial Path OrdersTcTTcT
Rewriting Right Hand Sides------
Root LabelingCaT, TcT---
Weak Dependency PairsTcTTcT
Dependency Tuples------
Path AnalysisTcTTcT
Weight Gap PrincipleTcTTcT
DG Decomposition------