Theoretical Computer Science
dspyz
  • Member for 8 years, 8 months
Profile Activity
Stats
836
reputation
8k
reached
7
answers
13
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (34)

Top network posts

This user doesn’t have any gold badges yet.
4
silver badges
13
bronze badges
View all badges

Top tags (25)

Score 9
Posts 3
Posts % 15
Score 8
Posts 5
Score 5
Posts 3
Score 4
Posts 7
Score 3
Posts 4
Score 2
Posts 5
View all tags →

Top posts (20)

All Questions Answers
Votes Newest
10 Is Almost-2-SAT NP-hard? Dec 19 '13
8 Is Almost-2-SAT NP-hard? Dec 20 '13
6 Would an optimal sorting network ever have to swap two numbers the "wrong" way Jun 26 '14
6 Does the 0-1 principle apply to merge networks? Aug 10 '14
5 Worst case ratio between minimum clique cover and maximum independent set Feb 5 '14
4 Asymptotic complexity of CDCL SAT solver that only selects negative literals Jul 20 '16
3 Translating pure literal elimination into rup Aug 31 '20
2 Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$ Feb 7 '13
2 M-clique covers in complete graphs Jan 17 '14
2 How to approximate minimum clique edge cover Feb 7 '13
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.