Computer Science
Meta user
Network profile
4,535
reputation
1
11
29

dkaeae

Theoretical CS PhD student

142
answers
3
questions
~22k
people reached
  • Germany
  • Member for 2 years, 5 months
  • 390 profile views
  • Last seen 13 hours ago

Communities (37)

Top Meta Posts
2
0

Top network posts

Top tags (109)

Score 105
Posts 39
Posts % 27
Score 51
Posts 13
Score 38
Posts 23
Score 29
Posts 16
Score 28
Posts 9
Score 24
Posts 15
View all tags →

Top posts (145) All Questions Answers | Votes Newest

21 If graph isomorphism is in P, is then P = NP? Jan 30
11 Show that there are infinitely more problems than we will ever be able to compute Jul 1
11 Is “Reachable Object” really an NP-complete problem? Apr 17
10 Can you prevent a man in the middle from reading the message? Feb 23
9 How are problems classified in Complexity Theory? Mar 29
7 Are “of the order of n” and “Big O” the same thing? May 15
5 How do web browsers find out the MAC address? Aug 22
5 What publication first introduced the concept of a non-deterministic Turing machine? Aug 8
5 Intuition behind eigenvalues of an adjacency matrix May 28
5 Give a Context Free Language, is the complement of this language always recursive(REC)? Jan 10
View all questions and answers →

Badges (41)

Gold

1

Rarest

Silver

11

Rarest

Bronze

29

Rarest

View all badges →