Well, there's roughly 2.5 days left. I haven't done nearly as much as what I had planned for my own project. I feel like...

How do we submit non-coded/textual entries? I've got what I think is a new NP_Complete problem that's described as a gam...

Factoring integers is clearly within the complexity class NP, but there isn't a proof that it's NP-complete. I'm not goi...

It's almost time to start, everybody! Don't get too stressed out if you don't make some major breakthrough. People have...

There's a whole giant list of NP-complete problems at https://en.wikipedia.org/wiki/List_of_NP-complete_problems

I haven't had a chance to figure this one out yet.

The input is a multiset, S, of positive integers. The goal is to partition the set into 2 subsets where the sum of the n...

Job sequencing is a bit complex. I'm not going to try to explain it. I found a video: https://youtu.be/MIvWBI8Xlyk There...

The input is a list of n items that have a weight, w[i], and a value v[i]. Also, there is an integer maximum weight for...

The input is a set T and a set U, where U is a subset of TxTxT. In other words, U is set of triples, where each triple's...

The inputs are a graph, G, and a list of terminal vertices. The goal is to create a subtree that spans all the terminal...

I'm confused about this problem, so I'm not going to try to describe it. It doesn't seem like anyone uses it.

I'm not familiar with this one either. Maybe someone else will have an explanation.

The inputs are a graph G and an integer k. The goal is to color all the vertices with at most k colors in such a way tha...

Given a graph G, a Hamiltonian circuit (a.k.a. Hamiltonian cycle) is a circuit that visits every vertex exactly once. Th...

This is another one I don't know anything about.

I don't know. I don't know anything about it, but it is 1 of Karp's problems.

In node cover (also known as vertex cover), the input is a graph G. The goal is to find a set of vertices such that ever...

In this problem, there's some giant set U. There's also a list of subsets S1, S2, S3, ..., Sn and an integer k. The goal...

In this problem, the input is an undirected graph and an integer k. If there is a clique of size k, return true. If ther...