YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A) -> f6(B) True (1,1) Signature: {(f0,1);(f6,1)} Flow Graph: [0->{}] + Applied Processor: TrivialSCCs + Details: The problem is already solved. YES(?,O(1))