An explicit isomorphism-invariant query on all finite structures in one fixed vocabulary of eight relations is decidable in deterministic polynomial time but is not definable in choiceless polynomial time with counting.
An explicit isomorphism-invariant query on all finite structures in one fixed vocabulary of eight relations is decidable in deterministic polynomial time but is not definable in choiceless polynomial time with counting.
An explicit isomorphism-invariant query on all finite structures in one fixed vocabulary of eight relations is decidable in deterministic polynomial time but is not definable in choiceless polynomial time with counting.
If correct, resolves the noncapture conjecture for the full choiceless counting formalism.
Does choiceless polynomial time with counting capture all polynomial-time queries?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
