Theoretical Computer Science
Meta user
Network profile
322
reputation
1
14

Elliot Gorokhovsky

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

1
answer
10
questions
~3k
people reached
  • Member for 5 years
  • 63 profile views
  • Last seen 21 hours ago

Communities (65)

Top Meta Posts
1
0

Top network posts

Top tags (15)

Score 3
Posts 2
Posts % 18
Score 0
Posts 4
Score 0
Posts 3
Score 0
Posts 2
Score 0
Posts 2
Score 0
Posts 1
View all tags →

Top posts (11) All Questions Answers | Votes Newest

14 Deciding whether an interval contains a prime number Jul 27 '18
5 What does “hold uniformly” mean in the context of asymptotic analysis? Jul 19 '18
4 Quicksort: compute the expected number of comparisons as a function of $M$ and $t$ Jun 19 '16
3 Is counting the words in a finite regular language #P-complete? Sep 7 '15
3 Example of a hardness-of-approximation proof which improves the approximation factor? Jun 20
3 Quicksort: compute the expected number of comparisons as a function of $M$ and $t$ Jun 20 '16
3 Algorithms for factorization using the decision version May 24 '15
2 Factoring semiprimes whose factors very close to a power of two Jul 25 '15
2 Preferable way to express $O(n2^n)$ Apr 12 '15
-2 Algorithm to determine if given algorithm runs in polynomial time [duplicate] Feb 22 '15
View all questions and answers →

Badges (15)

Gold

—

Silver

1

Rarest

Bronze

14

Rarest

View all badges →