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 201020092008
Arctic InterpretationCaT, TcTCaT, TcTCaT, TcT
Match BoundsCaT, TcTCaT, TcTCaT, TcT
Matrix Interpretation TriangularTcT (N)CaT (N),
Matchbox (N),
TcT (N)
TcT (N)
Matrix Interpretation Non-Triangular CaT (N,R,Q), Matchbox (N)------
Modular (Relative) Complexity AnalysisCaTCaT---
Rewriting Right Hand Sides---TcTCaT
Root LabelingCaTCaT, TcTCaT
Weight Gap PrincipleCaT, TcTCaT---

Runtime Complexity

next year or prev year

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