Skip to main navigation
Skip to search
Skip to main content
University of Luebeck Home
English
Deutsch
Home
Research Units
Experts
Projects
Publications
Prizes
Spin-Offs
Media
Activities
Search by expertise, name or affiliation
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth
Michael Elberfeld, Andreas Jakoby,
Till Tantau
Institute of Theoretical Computer Science
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Tree Automata
100%
Logarithmic
87%
Tree Decomposition
68%
Counting Problems
65%
Decision problem
53%
Theorem
42%
Logic
41%
Labeled Trees
34%
Pushdown Automata
32%
Integer Linear Programming
32%
Bounded Treewidth
31%
Unordered
31%
Class
30%
Unary
28%
Family
24%
Linear Time
22%
Counting
22%
Completeness
21%
Convolution
21%
Lemma
21%
Path
17%
Computing
16%
Term
14%
Graph in graph theory
12%
Model
8%