Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth

Mathematics

• Counting Problem 100%
• Convolution 50%
• Linear Time 50%
• Class C 50%
• Labeled Trees 50%
• Fixed Number 50%
• Integer 50%
• Linear Programming 50%
• Completeness Proof 50%

Computer Science

• Tree Automaton 100%
• Tree Decomposition 66%
• Decision Problem 66%
• Completeness Proof 33%
• Accepting Path 33%
• Pushdown Automaton 33%
• Integer-Linear Programming 33%