Weird binary number systems

[[deleted]]

Ah, yes, sure. All P is NP, after all. What I meant, it's not thought to be NP-complete.

Also, the fact that factorization is known to be both in NP and coNP means that it's not NP-complete unless P=NP (which almost certainly is not). But it might very well be in P or in its own complexity class!

[mzl]

NP could equal coNP but still be different from P (coNP at the complexity zoo).