Computer Science
Kyle Jones
  • Seattle, WA
  • Member for 9 years, 6 months
Profile Activity
Stats
7,570
reputation
171k
reached
149
answers
1
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (83)

Top Meta Posts
0
2

Top network posts

1
gold badge
23
silver badges
47
bronze badges
View all badges

Top tags (117)

Score 261
Posts 63
Posts % 42
Score 185
Posts 42
Score 168
Posts 34
Score 119
Posts 20
Score 100
Posts 21
Score 75
Posts 15
View all tags →

Top posts (150)

All Questions Answers
Votes Newest
30 Is there a difference between top-down and bottom-up dynamic programming? Dec 23 '11
19 Is UTF-8 the final character encoding for all future time? Jun 14 '20
19 NP-complete problems not "obviously" in NP Jun 19 '14
17 Is finding a solution of a satisfiability problem harder than deciding satisfiability? Aug 29 '14
15 What is wrong with this simple proof of P=NP? Mar 31 '20
15 Converting (math) problems to SAT instances May 18 '13
14 Is the following problem NP-hard? (or have you seen it before?) Apr 27
13 Is 2-SAT with XOR-relations NP-complete? May 14 '15
13 Is the "subset product" problem NP-complete? Jun 25 '14
13 Encoding 1-out-of-n constraint for SAT solvers Jul 10 '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.