Popular Question - Badge - Computer Science Stack Exchange

Popular Question

Question with 1,000 views. This badge can be awarded multiple times.

Jen Stone

1551 silver badge5 bronze badges

earned this badge 3 times.

Prove that {0^{n^3} | n≥0} is not context free

Awarded Jan 2 '17 at 5:07

If P = NP, how do I prove I can find the maximum clique in polynomial time?

Awarded Nov 16 '16 at 0:56

Is every subset of a decidable set, also decidable?

Awarded Apr 23 '15 at 22:33

Others with this badge

Computer Science Stack Exchange works best with JavaScript enabled