Computer Science
dkaeae
  • Germany
  • Member for 4 years, 5 months
Profile Activity
Stats
4,809
reputation
70k
reached
142
answers
5
questions
About

Theoretical CS PhD student

Communities (39)

Top Meta Posts
2
0

Top network posts

1
gold badge
13
silver badges
30
bronze badges
View all badges

Top tags (107)

Score 111
Posts 40
Posts % 27
Score 52
Posts 13
Score 39
Posts 23
Score 31
Posts 16
Score 30
Posts 9
Score 23
Posts 15
View all tags →

Top posts (147)

All Questions Answers
Votes Newest
22 If graph isomorphism is in P, is then P = NP? Jan 30 '19
12 Show that there are infinitely more problems than we will ever be able to compute Jul 1 '19
11 Is "Reachable Object" really an NP-complete problem? Apr 17 '19
10 Can you prevent a man in the middle from reading the message? Feb 23 '19
9 How are problems classified in Complexity Theory? Mar 29 '19
8 Are "of the order of n" and "Big O" the same thing? May 15 '19
6 Intuition behind eigenvalues of an adjacency matrix May 28 '19
5 Basic Theta-notation question Aug 23 '19
5 How do web browsers find out the MAC address? Aug 22 '19
5 Halting problem in EXP-complete Aug 12 '19
View all questions and answers →

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.