Help Center > Badges

 Enlightened First to answer and accepted with score of 10 or more. This badge can be awarded multiple times.

Mateus de Oliveira Oliveira earned this badge 5 times
may 24 at 19:47
Is induced subgraph isomorphism easy on an infinite subclass?
mar 23 at 18:21
Is adiabatic quantum computing as powerful as qubit computing?
dec 11 at 6:29
What is known about the relationship between PR and NEXP?
sep 1 '11 at 18:55
What is the current known hardness of Graph Isomorphism?
apr 17 '11 at 11:40
Is there a theory to answer “the simplest program to solve a problem”?

Others with this badge