Theoretical Computer Science
Sebastian Siebertz's user avatar
Sebastian Siebertz's user avatar
Sebastian Siebertz's user avatar
Sebastian Siebertz
  • Member for 10 years, 7 months
  • Last seen more than 3 years ago
Profile Activity
Stats
1,096
reputation
8k
reached
10
answers
4
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
9
silver badges
11
bronze badges
Top tags
View all tags
34
Score
8
Posts
57
Posts %
28
Score
6
Posts
43
Posts %
21
Score
5
Posts
36
Posts %
20
Score
3
Posts
21
Posts %
20
Score
3
Posts
21
Posts %
20
Score
2
Posts
14
Posts %
Top posts
View all questions and answers
question
13
Complexity of computing a densest minor
Oct 4, 2013
answer
11
Generalization of locally bounded treewidth graphs
Sep 23, 2013
answer
10
Subgraph isomorphism with a tree
Sep 27, 2013
answer
9
Exact Algorithms for r-Dominating Set on Bounded Treewidth Graphs
Nov 8, 2013
answer
8
Is there a logic without induction that captures much of P?
Sep 25, 2013
answer
7
Complexity of computing a densest minor
Oct 24, 2013
answer
6
What is wrong with this $\mathsf{L} \subseteq \mathsf{L}-$uniform $\mathsf{NC}^1$ argument?
Oct 29, 2013
answer
6
Expressiveness of Infinitary Logic
Jul 5, 2014
answer
5
What is the descriptive complexity of the basic modal logic?
Dec 2, 2013
question
5
Lemma about intersecting sets
Oct 31, 2013