Theoretical Computer Science
Dmitri Urbanowicz's user avatar
Dmitri Urbanowicz's user avatar
Dmitri Urbanowicz's user avatar
Dmitri Urbanowicz
  • Member for 5 years, 6 months
  • Last seen more than a month ago
Profile Activity
Stats
378
reputation
1k
reached
4
answers
1
question
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
1
silver badge
10
bronze badges
Top tags
View all tags
9
Score
1
Posts
20
Posts %
9
Score
1
Posts
20
Posts %
9
Score
1
Posts
20
Posts %
9
Score
1
Posts
20
Posts %
7
Score
2
Posts
40
Posts %
7
Score
2
Posts
40
Posts %
Top posts
All Questions Answers
Score Newest
answer
9
Finding a minimal DFA whose language has a desired intersection with another
May 15, 2018
answer
7
How fast can we find and disconnect roots in a forest?
May 21, 2018
question
7
How fast can we find and disconnect roots in a forest?
May 13, 2018
answer
2
Why is it a mystery if PSPACE ?= EXPTIME?
Aug 28, 2018
answer
1
Clarification of leftmost maximal periodicities
May 31, 2018
Top network posts
View all network posts
6
Is there a useful algorithm with a decreasing asymptotic time?
6
What are the disadvantages of Fibonacci Heaps?
5
Cartoon TV series about a boy and an alien (flying head) living in the boy's watches
5
Why doesn't Searle's argument apply against humans?

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.