Theoretical Computer Science
Super0's user avatar
Super0's user avatar
Super0's user avatar
Super0
Unregistered
  • Member for 9 years
  • Last seen more than 8 years ago
Profile Activity
Stats
269
reputation
8k
reached
8
answers
3
questions
Communities
Badges
This user doesn’t have any gold badges yet.
2
silver badges
4
bronze badges
Top tags
View all tags
11
Score
3
Posts
27
Posts %
8
Score
1
Posts
9
Posts %
3
Score
2
Posts
18
Posts %
2
Score
2
Posts
18
Posts %
2
Score
1
Posts
9
Posts %
2
Score
1
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
8
NP-hard problems on paths
Feb 4, 2014
question
2
Complexity of ambiguous parsing?
Mar 30, 2014
answer
2
Complexity of topological sort with constrained positions
Sep 19, 2013
answer
2
Proof for ACYCLIC PARTITION being NP-complete
Mar 1, 2014
answer
2
Is there a non Turing-complete model of computation whose halting problem is undecidable?
Mar 28, 2014
answer
1
Turing-complete computation models on graphs
Mar 28, 2014
question
1
Maximum matching versus preferential assignment
Mar 17, 2014
answer
1
Maximum matching versus preferential assignment
Apr 16, 2014
question
0
Theta functions of automata relations
Mar 31, 2014
answer
0
Complexity of ambiguous parsing?
Apr 2, 2014

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.