Theoretical Computer Science
user avatar
user avatar
user avatar
dspyz
  • Member for 9 years, 4 months
  • Last seen more than a month ago
Profile Activity
Stats
916
reputation
8k
reached
8
answers
15
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
4
silver badges
13
bronze badges
Top tags
View all tags
9
Score
3
Posts
13
Posts %
8
Score
5
Posts
22
Posts %
5
Score
3
Posts
13
Posts %
4
Score
7
Posts
30
Posts %
3
Score
4
Posts
17
Posts %
3
Score
3
Posts
13
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
10
Is Almost-2-SAT NP-hard?
Dec 19, 2013
answer
8
Is Almost-2-SAT NP-hard?
Dec 20, 2013
question
6
Would an optimal sorting network ever have to swap two numbers the "wrong" way
Jun 26, 2014
question
6
Does the 0-1 principle apply to merge networks?
Aug 10, 2014
question
5
Worst case ratio between minimum clique cover and maximum independent set
Feb 5, 2014
question
5
Can a normal form term be extensionally equivalent to a term with no WHNF?
Dec 6, 2021
question
4
Asymptotic complexity of CDCL SAT solver that only selects negative literals
Jul 20, 2016
question
3
Translating pure literal elimination into rup
Aug 31, 2020
answer
3
Can a normal form term be extensionally equivalent to a term with no WHNF?
Dec 6, 2021
answer
2
Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$
Feb 7, 2013
Top network posts
View all network posts
65
Super User versus Unix and Linux versus Ask Ubuntu
34
Comprehensive Rules for Game of Thrones Lines of Succession
30
Java using up far more memory than allocated with -Xmx
25
Solving Three Open Problems with a Halting Oracle
13
What happens if you ambassador a hovel?

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.