Theoretical Computer Science
rotia's user avatar
rotia's user avatar
rotia's user avatar
rotia
  • Member for 9 years, 1 month
  • Last seen more than 5 years ago
Profile Activity
Stats
101
reputation
200
reached
1
answer
0
questions
Communities
Badges
1
gold badge
1
silver badge
2
bronze badges
Top tags
4
Score
1
Posts
100
Posts %
4
Score
1
Posts
100
Posts %
Top posts
All Questions Answers
Score Newest
answer
4
Interesting unanswered questions on CS.SE
Nov 26, 2016
Top network posts
View all network posts
6
MIN-2-XOR-SAT and MAX-2-XOR-SAT: are they NP-hard?
6
Is this classic puzzle book game NP-complete?
5
Can deterministic Turing machine beats/wins (if possible) the "Bombs and Levers" game in polynomial time?

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.