Computational complexity
A random open question I am curious about, but doesn’t seem that important: Is the existence of a morphism between Cartesian frames NP-complete?
Computational complexity
A random open question I am curious about, but doesn’t seem that important: Is the existence of a morphism between Cartesian frames NP-complete?