Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
Hermann Gruber
  • Member for 11 years, 6 months
  • Last seen this week
Profile Activity
Stats
5,424
reputation
98k
reached
67
answers
2
questions
Communities
View all
About

Hermann Gruber

Badges
View all badges
1
gold badge
29
silver badges
54
bronze badges
Top tags
View all tags
216
Score
25
Posts
36
Posts %
138
Score
14
Posts
20
Posts %
83
Score
18
Posts
26
Posts %
82
Score
8
Posts
12
Posts %
66
Score
9
Posts
13
Posts %
62
Score
5
Posts
7
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
35
What are the recent TCS books whose drafts are available online?
Dec 5, 2010
answer
28
computing the minimal NFA for a DFA
Mar 26, 2012
question
22
Protocol partition number and deterministic communication complexity
Jan 13, 2011
answer
22
The origin of the notion of treewidth
Feb 24, 2011
answer
20
What is the number of languages accepted by a DFA of size $n$?
Aug 22, 2011
answer
20
Are there any open problems left about DFAs?
May 11, 2014
answer
19
Status of Cerny Conjecture?
Nov 25, 2010
question
16
Is graph coloring complete for poly-APX?
Jul 20, 2014
answer
16
What notable automaton models have polynomially-decidable containment?
Jun 21, 2014
answer
14
What is an unambiguous language in the sense of Schützenberger?
Aug 16, 2011
Top Meta posts
0
3
9
Original proofs generated on the parent site
5
Original proofs generated on the parent site
4
Original proofs generated on the parent site
Top network posts
View all network posts
8
L'Intermédiaire des mathématiciens
7
Are there any NP complete problems in SUB EXP TIME?
6
How did von Neumann come up with his merge sort algorithm?
5
Why did Richard Bellman, creator of dynamic programing say: 1950s were not good years for maths?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.