It is not the case that Many AC^0-complete problems (like parity on unordered sets) have straightforward polynomial-time solutions without lexical ordering.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.