Stack Exchange

Kurt Mueller

Undergraduate at Carnegie Mellon

top accounts reputation activity favorites subscriptions

Top Questions

NEXPTIME-completeness with more time for reductions

cc.complexity-theory asked Jul 22 '14 at 15:59

cstheory.stackexchange.com

Exponential analogue of NC?

complexity-theory reference-request parallel-computing complexity-classes asked Sep 22 '14 at 15:25

cs.stackexchange.com

Top Answers

Direct NP-Complete proofs

cs.stackexchange.com

Halting problem without self-reference

cs.stackexchange.com

Decide if a specific Turing machine halts on a specific string

cs.stackexchange.com