We changed our privacy policy. Read more.
Theoretical Computer Science
Super8
Unregistered
  • Member for 7 years, 7 months
Profile Activity
Stats
304
reputation
4k
reached
9
answers
6
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (1)

Top network posts

We respect a laser-like focus on one topic.

This user doesn’t have any gold badges yet.
2
silver badges
7
bronze badges

Top tags (27)

Score 6
Posts 3
Posts % 20
Score 5
Posts 3
Score 5
Posts 3
Score 5
Posts 1
Score 4
Posts 1
Score 3
Posts 4
View all tags →

Top posts (15)

All Questions Answers
Votes Newest
9 Turing machines whose termination is unprovable? Mar 5 '14
5 Evidence of non P-hard problems that require polynomial space? Apr 25 '14
5 Graph coloring minimizing the number of colors in every independent set Feb 26 '14
4 For which values of $k$ is the $k$-disjoint paths problem in $\mathcal{P}$? Apr 6 '14
3 Extensions of Matrix-Tree Theorem Mar 13 '14
2 Faithful functors vs forgetful functors: exact category-theoretic defs? Apr 17 '14
2 Assessing the unavoidability of a set kof structures? Apr 5 '14
1 Are there any polynomial cases of Balanced Minimum Evolution? Apr 6 '14
1 NP-complete graph property that is hereditary, but not additive? Mar 1 '14
1 Funny TCS-related papers etc? Mar 1 '14
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.