Immerman-Vardi captures the essential logical content of P: solvability by deterministic polynomial-time algorithms, regardless of structural encoding.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.