It is not the case that Immerman-Vardi captures the essential logical content of P: solvability by deterministic polynomial-time algorithms, regardless of structural encoding.
?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.