user avatar
user avatar
user avatar
Kyle Jones
  • Member for 10 years, 2 months
  • Last seen this week
  • Seattle, WA
31 votes

Is there a difference between top-down and bottom-up dynamic programming?

19 votes
Accepted

NP-complete problems not "obviously" in NP

19 votes
Accepted

Is finding a solution of a satisfiability problem harder than deciding satisfiability?

19 votes

Is UTF-8 the final character encoding for all future time?

16 votes

What is wrong with this simple proof of P=NP?

14 votes

Converting (math) problems to SAT instances

14 votes

Encoding 1-out-of-n constraint for SAT solvers

14 votes

Is the following problem NP-hard? (or have you seen it before?)

13 votes
Accepted

Can there be a perfect chess algorithm?

13 votes
Accepted

Is the "subset product" problem NP-complete?

13 votes
Accepted

Is 2-SAT with XOR-relations NP-complete?

12 votes
Accepted

What is wrong with this seeming contradiction with a paper about AND-compression of SAT?

11 votes
Accepted

Why don't modern SAT solvers use the notion of a "watched clause", in the same way they use the notion of a "watched literal"?

11 votes
Accepted

If one shows that UNIQUE k-SAT is in P, does it imply P=NP?

11 votes

How to find a basis which is guaranteed to need 9 or less characters to represent a 12 digits number?

11 votes

Is HORN-SAT in LIN, if so why is that not an indication that P=LIN?

10 votes
Accepted

Should activation function be monotonic in neural networks?

10 votes
Accepted

Recipe book for SAT encodings?

9 votes
Accepted

Supporting data structures for SAT local search

9 votes

Why is the class NP-Complete important compared to NP-hard?

9 votes
Accepted

Is order of bits in byte really not of concern?

9 votes
Accepted

Random restarts for unsatisfiable instances

9 votes
Accepted

What's the point of 48 bit colour?

8 votes
Accepted

Would it be possible to use the cloud for RAM?

7 votes
Accepted

Conflict Driven Clause Learning backtracking clarification

7 votes
Accepted

Why is pure literal elimination absent in DPLL-based algorithms like Chaff?

7 votes
Accepted

Could an NP-hard problem have a mechanical or physical solution method?

7 votes
Accepted

Why is DPLL better than brute force?

7 votes
Accepted

Solving SAT using tableau calculus

7 votes
Accepted

I am having trouble understanding (and implementing) logistic regression for classifying into three classes

1
2 3 4 5 6