Theoretical Computer Science
Hermann Gruber
  • Member for 11 years
  • Last seen this week
Profile Activity
Stats
5,314
reputation
95k
reached
65
answers
2
questions
Communities
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
37
Posts %
132
Score
13
Posts
19
Posts %
82
Score
8
Posts
12
Posts %
81
Score
17
Posts
25
Posts %
66
Score
9
Posts
13
Posts %
62
Score
5
Posts
7
Posts %
Top posts
View all questions, answers, and articles
All Questions Answers Articles
Votes Newest
35
What are the recent TCS books whose drafts are available online?
Dec 5 '10
28
computing the minimal NFA for a DFA
Mar 26 '12
22
Protocol partition number and deterministic communication complexity
Jan 13 '11
22
The origin of the notion of treewidth
Feb 24 '11
20
What is the number of languages accepted by a DFA of size $n$?
Aug 22 '11
20
Are there any open problems left about DFAs?
May 11 '14
19
Status of Cerny Conjecture?
Nov 25 '10
16
Is graph coloring complete for poly-APX?
Jul 20 '14
16
What notable automaton models have polynomially-decidable containment?
Jun 21 '14
14
What is an unambiguous language in the sense of Schützenberger?
Aug 16 '11
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.