Skip to main content
Theoretical Computer Science
Andras Farago's user avatar
Andras Farago's user avatar
Andras Farago's user avatar
Andras Farago
  • Member for 12 years
  • Last seen more than a month ago
Profile Activity
Stats
11,446
reputation
91k
reached
37
answers
63
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
38
silver badges
72
bronze badges
Top tags
View all tags
159
Score
76
Posts
76
Posts %
80
Score
24
Posts
24
Posts %
20
Score
28
Posts
28
Posts %
20
Score
10
Posts
10
Posts %
17
Score
25
Posts
25
Posts %
12
Score
15
Posts
15
Posts %
Top posts
View all questions and answers
question
55
For which problems in P is it easier to verify the result than to find it?
Oct 31, 2015
question
46
Obituaries of dead conjectures
Oct 5, 2015
question
39
Why does randomness have stronger effect on reductions than on algorithms?
Dec 21, 2012
question
38
Examples where the uniqueness of the solution makes it easier to find
Apr 12, 2014
question
37
Hardness of approximation without the PCP theorem
Dec 2, 2012
question
34
Hardest known natural problem in P?
Jan 9, 2014
question
34
Why are so few natural candidates for NP-intermediate status?
Feb 7, 2014
question
34
The unreasonable power of non-uniformity
Apr 30, 2014
question
31
Hard-looking algorithmic problems made easy by theorems
Feb 13, 2014
question
26
Optimization problems with minimax characterization, but no polynomial-time algorithm
Feb 14, 2014
Top network posts
View all network posts
11
Can deleting a random entry from an iid sequence destroy the iid property?