Skip to main content
Theoretical Computer Science
Hartmut Klauck's user avatar
Hartmut Klauck's user avatar
Hartmut Klauck's user avatar
Hartmut Klauck
  • Member for 14 years
  • Last seen more than 9 years ago
Profile Activity
Stats
585
reputation
3k
reached
4
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
8
bronze badges
Top tags
View all tags
44
Score
4
Posts
100
Posts %
33
Score
3
Posts
75
Posts %
21
Score
1
Posts
25
Posts %
21
Score
1
Posts
25
Posts %
11
Score
1
Posts
25
Posts %
11
Score
1
Posts
25
Posts %
Top posts
answer
21
Communication Complexity ...Classes?
Dec 24, 2010
answer
11
Interactive Proof for HORN-SAT?
Feb 17, 2011
answer
8
Stronger Lower Bounds on Nondeterministic Multiparty Communication
Dec 24, 2010
answer
4
The relationship between QCMA and QMA in the Turing and Communication model
Dec 16, 2014