Dmytro Taranovsky

Member for 6 years, 2 months
Last seen this week

Summary

Reputation

2,537

2.5k
2.3k
2k

2020
2021
2022
2023

Top tag

cc.complexity-theory

Next privilege

3,000 Rep.

Cast close & reopen votes

Badges

Newest

Yearling

Next badge

100/100

Fanatic

Answers

View all 24 answers

Score Activity Newest

Does $∩_{ε>0} \mathrm{DTIME}(O(n^{2+ε})) = \mathrm{DTIME}(n^{2+o(1)})$?

Sep 17, 2017

How to prove $P^{Halt} = PSPACE^{Halt}$

Oct 28, 2017

Sorting with an average of $\mathrm{lg}(n!)+o(n)$ comparisons

Sep 4, 2018

Time Hierarchies in DSPACE(O(s(n)))

Sep 22, 2017

Justification of log f in DTIME hierarchy theorem

Sep 11, 2017

Questions

View all 14 questions

Score Activity Newest Views

Fine-grained complexity of BPP

Oct 5, 2017

Does $∩_{ε>0} \mathrm{DTIME}(O(n^{2+ε})) = \mathrm{DTIME}(n^{2+o(1)})$?

Sep 15, 2017

An algebra of complexity classes

Aug 27, 2018

Sorting with an average of $\mathrm{lg}(n!)+o(n)$ comparisons

Sep 4, 2018

Complexity of fractional SAT

Oct 14, 2018

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

gold badge

Fanatic

Dec 16, 2017

silver badges

Enthusiast

Oct 7, 2017
Necromancer

× 3

Jul 5, 2021
Yearling

× 6

Sep 8

bronze badges

Mortarboard

Nov 27, 2017
Self-Learner

Sep 18, 2017
Curious

Dec 7, 2017

Accounts

MathOverflow

5,847
1
18
38

Theoretical Computer Science

2,537
1
10
24

Mathematics

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

upvotes

downvotes

question votes

answer votes

User feed

Stack Exchange Network

Summary

Top tag

Next privilege

Newest

Next badge

Answers

Questions

Tags

Reputation

Badges

Accounts

Active bounties (0)

Votes cast