Theoretical Computer Science
Alexey Milovanov's user avatar
Alexey Milovanov's user avatar
Alexey Milovanov's user avatar
Alexey Milovanov
  • Member for 9 years, 4 months
  • Last seen this week
Profile Activity
Stats
1,973
reputation
10k
reached
3
answers
38
questions
Communities
View all
About

http://solid-lelik.jimdo.com/

Badges
View all badges
This user doesn’t have any gold badges yet.
10
silver badges
21
bronze badges
Top tags
View all tags
9
Score
29
Posts
71
Posts %
5
Score
19
Posts
46
Posts %
3
Score
3
Posts
7
Posts %
1
Score
5
Posts
12
Posts %
0
Score
5
Posts
12
Posts %
0
Score
3
Posts
7
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
13
A game on several graphs
Aug 8, 2019
question
11
Is unary $\Pi_2$-SUBSETSUM coNP-complete?
Sep 17, 2019
question
11
Is DSPACE(n) = DSPACE(1.5n)?
Nov 21, 2018
question
10
On Courcelle's question about Monadic second-order logic with cardinality predicates
Oct 9, 2019
question
10
Is this game EXPSPACE-complete?
Aug 18, 2018
question
10
What is the complexity of this game?
Oct 21, 2018
question
10
Fine-grained complexity for game-type problems
Oct 9
question
9
Noether’s Normalization Lemma for finite fields
Mar 2, 2017
question
9
On theoretical aproaches for solving $\mathsf{SAT}$ in special cases
Sep 22, 2019
question
7
Difference between time-bounded and memory-bounded Kolmogorov complexity
Sep 27, 2016
Top network posts
View all network posts
19
Kolmogorov complexity is the strongest noncomputable function
18
Kolmogorov complexity is the strongest noncomputable function
13
An efficient isomorphism between finite fields
12
An entropy inequality
12
Geometric complexity theory for finite fields

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.