This seems pretty unlikely, as it is known to be solvable in quasi polynomial time. If np-complete, all problems in NP could be solved in this running time, which would contradict the exponential time hypothesis which is widely believed to hold true (https://en.wikipedia.org/wiki/Exponential_time_hypothesis)

@Floffinou Good point. Here is a market for ETH

What happens if P = NP?

@LukeBousfield In that case the notion of NP-completeness sort of breaks down so I was planning to resolve N/A

@BoltonBailey Technically if P=NP then all problems in P are NP-complete.

@gregrosent Yes, that is why the criteria are phrased so awkwardly. If you want a market with cleaner alternatives try this one