mod_k_p (335B)
1 # Mod k p 2 3 https://complexityzoo.net/Complexity_Zoo:M#modkp 4 5 [Computational_problem] solvable by [nondeterministic_Turing_machine] where the [acceptance_condition] is that the number of [accepting_runs] is NOT [divisible] by k. 6 7 For k=2, [parity_p] 8 9 Up: [parity_p] 10 11 See also: [modular_counting], [sharp_k_p], [mod_k_l] 12 13 Aliases: ModkP