Theoretical Computer Science
Profile Activity
Meta user
Network profile
1,924
reputation
18
26

Pratik Deoghare

Apparently, this user prefers to keep an air of mystery about them.

37
answers
3
questions
~274k
people reached

Communities (55)

Top Meta Posts
1
0

Top network posts

Top tags (50)

Score 41
Posts 11
Posts % 28
Score 39
Posts 12
Score 37
Posts 10
Score 25
Posts 3
Score 17
Posts 3
Score 8
Posts 5
View all tags →

Top posts (40)

All Questions Answers
Votes Newest
44 What papers should everyone read? Sep 15 '10
27 Why would a TCS researcher need funding? Jan 5 '11
21 Explain P = NP problem to 10 year old Feb 27 '11
21 Concepts in theoretical CS that would be approachable ages 8-14 Feb 24 '12
20 Hard-looking algorithmic problems made easy by theorems Feb 13 '14
15 Is there a polynomial-time algorithm to solve graph isomorphism for Delaunay graphs of (finite) hexagonal tessellations? Jan 8 '11
13 What papers should everyone read? Sep 15 '10
13 Reducing redundant edges from a dependency graph Jun 27 '11
11 What math courses should I take to prepare for a CS masters or PhD? Mar 7 '11
9 Hard-looking algorithmic problems made easy by theorems Mar 1 '14
View all questions and answers →

Badges (44)

Gold

—

Silver

18

Rarest

Bronze

26

Rarest

View all badges →

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.