We’re rewarding the question askers & reputations are being recalculated! Read more.
Computer Science
Meta user
Network profile
250
reputation
1
5

Hermann Gruber

Hermann Gruber

7
answers
0
questions
~533
people reached
  • Germany
  • hermann-gruber.com
  • Member for 5 years, 10 months
  • 21 profile views
  • Last seen 10 hours ago

Communities (5)

Top network posts

Top tags (11)

Score 8
Posts 4
Posts % 57
Score 2
Posts 2
Score 2
Posts 1
Score 2
Posts 1
Score 2
Posts 1
Score 2
Posts 1
View all tags →

Top posts (7) All Questions Answers | Votes Newest

6 Are there any NP complete problems in SUB EXP TIME? Sep 27
2 Find both lower and upper asymptotic bounds for $T(n) = 2T(\frac{n}{2})+n^4$ Sep 26
2 What are the axioms of automata theory? Feb 16
1 On satisfiability for 2-variable FOL being NEXPTIME-complete Nov 1
1 If a problem is not in NP, prove that every NP problem can be efficiently reduced to it Oct 23
0 Black Box Decision problem for NFA Oct 2
0 A language in NSPACE(O(n)) and very likely not in DSPACE(O(n)) Feb 17

Badges (6)

Gold

—

Silver

1

Rarest

Bronze

5

Rarest