We’re rewarding the question askers & reputations are being recalculated! Read more.
Theoretical Computer Science
Meta user
Network profile
269
reputation
2
4

Super0
Unregistered

Apparently, this user prefers to keep an air of mystery about them.

8
answers
3
questions
~7k
people reached
  • Member for 6 years, 2 months
  • 218 profile views
  • Last seen May 20 '14 at 19:18

Communities (1)

Top network posts

We respect a laser-like focus on one topic.

Top tags (22)

Score 11
Posts 3
Posts % 27
Score 8
Posts 1
Score 3
Posts 2
Score 2
Posts 2
Score 2
Posts 1
Score 2
Posts 1
View all tags →

Top posts (11) All Questions Answers | Votes Newest

8 NP-hard problems on paths Feb 4 '14
2 Complexity of ambiguous parsing? Mar 30 '14
2 Complexity of topological sort with constrained positions Sep 19 '13
2 Proof for ACYCLIC PARTITION being NP-complete Mar 1 '14
2 Is there a non Turing-complete model of computation whose halting problem is undecidable? Mar 28 '14
1 Turing-complete computation models on graphs Mar 28 '14
1 Maximum matching versus preferential assignment Mar 17 '14
1 Maximum matching versus preferential assignment Apr 16 '14
0 Theta functions of automata relations Mar 31 '14
0 Complexity of ambiguous parsing? Apr 2 '14
View all questions and answers →

Badges (6)

Gold

—

Silver

2

Rarest

Bronze

4

Rarest