Theoretical Computer Science
Meta user
Network profile
1,467
reputation
1
3
21

Dmytro Taranovsky

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

18
answers
11
questions
~6k
people reached
  • Member for 1 year, 9 months
  • 146 profile views
  • Last seen Jun 21 at 7:02

Communities (3)

Top network posts

Top tags (25)

Score 48
Posts 23
Posts % 79
Score 27
Posts 10
Score 16
Posts 9
Score 10
Posts 4
Score 8
Posts 6
Score 4
Posts 4
View all tags →

Top posts (29) All Questions Answers | Votes Newest

18 Fine-grained complexity of BPP Oct 5 '17
16 An algebra of complexity classes Aug 27 '18
15 Does $∩_{ε>0} \mathrm{DTIME}(O(n^{2+ε})) = \mathrm{DTIME}(n^{2+o(1)})$? Sep 15 '17
10 Sorting with an average of $\mathrm{lg}(n!)+o(n)$ comparisons Sep 4 '18
10 Does $∩_{ε>0} \mathrm{DTIME}(O(n^{2+ε})) = \mathrm{DTIME}(n^{2+o(1)})$? Sep 17 '17
9 Best known asymptotic PCP sizes / 3-SAT Oct 30 '18
8 Complexity of fractional SAT Oct 14 '18
6 Complexity Class Equalities on the Edge of Inconsistency Sep 8 '17
5 Time Hierarchies in DSPACE(O(s(n))) Sep 22 '17
5 Does a non-constructive proof of bounds of a computable asymptotic complexity, with impossible fix, exist? Sep 29 '18
View all questions and answers →

Badges (25)

Gold

1

Rarest

Silver

3

Rarest

Bronze

21

Rarest

View all badges →