Theoretical Computer Science
Dmytro Taranovsky
  • Member for 4 years
Profile Activity
Stats
2,202
reputation
8k
reached
20
answers
11
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (3)

Top network posts

1
gold badge
8
silver badges
22
bronze badges
View all badges

Top tags (30)

Score 56
Posts 23
Posts % 74
Score 32
Posts 10
Score 25
Posts 10
Score 12
Posts 6
Score 12
Posts 4
Score 7
Posts 4
View all tags →

Top posts (31)

All Questions Answers
Votes Newest
21 Fine-grained complexity of BPP Oct 5 '17
15 Does $∩_{ε>0} \mathrm{DTIME}(O(n^{2+ε})) = \mathrm{DTIME}(n^{2+o(1)})$? Sep 15 '17
15 An algebra of complexity classes Aug 27 '18
13 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 Complexity of fractional SAT Oct 14 '18
9 Best known asymptotic PCP sizes / 3-SAT Oct 30 '18
7 Sorting with an average of $\mathrm{lg}(n!)+o(n)$ comparisons Sep 4 '18
6 Time Hierarchies in DSPACE(O(s(n))) Sep 22 '17
6 Complexity Class Equalities on the Edge of Inconsistency Sep 8 '17
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.