Tour
About Us
Meta
Loading…
Log in
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Stack Exchange
All Sites
Top Users
Digests
Kurt Mueller
Undergraduate at Carnegie Mellon
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
13
votes
NEXPTIME-completeness with more time for reductions
cc.complexity-theory
time-complexity
nexp
asked Jul 22 '14 at 15:59
cstheory.stackexchange.com
8
votes
Exponential analogue of NC?
complexity-theory
reference-request
parallel-computing
complexity-classes
asked Sep 22 '14 at 15:25
cs.stackexchange.com
Top Answers
10
Direct NP-Complete proofs
cs.stackexchange.com
7
Halting problem without self-reference
cs.stackexchange.com
5
Decide if a specific Turing machine halts on a specific string
cs.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
cs.stackexchange.com