MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How to prove than multiplying § § X § boolean matrices and a graph ∑ with a clique size of 100 is in Nick's Class (NC)

share|cite|improve this question
Dear Matthew: I don't know any complexity theory, so this question might be just showing my naïveté. But are you sure you meant for the question to display as "§ § X § boolean matrices"? More broadly, even if this is how you want your question to display, I recommend that you add a bit more to the content of the question. (The title is in the right spirit, summing up the question.) I like to see some background and motivation in every question, glossing of terms, etc. – Theo Johnson-Freyd Mar 10 '11 at 1:44
Dear bill, can we still call you Matthew? – Yemon Choi Mar 10 '11 at 20:15

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.