Tour
About Us
Meta
Loading…
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
Log in
Stack Exchange
All Sites
Top Users
Digests
maschka
top
accounts
reputation
activity
subscriptions
Top Questions
43
votes
Many-one reductions vs. Turing reductions to define NPC
cc.complexity-theory
np-hardness
reductions
asked Aug 17, 2010 at 12:58
cstheory.stackexchange.com
16
votes
Avalanche like stochastic process
pr.probability
markov-chains
stochastic-process
asked Nov 7, 2010 at 17:49
cstheory.stackexchange.com
13
votes
Why are these two definitions of PPAD equivalent?
cc.complexity-theory
complexity-classes
ppad
asked Oct 17, 2010 at 14:19
cstheory.stackexchange.com
Top Answers
37
Complexity of the simplex algorithm
cstheory.stackexchange.com
25
A simple approximation algorithm for the TSP
cstheory.stackexchange.com
19
Problems Between P and NPC
cstheory.stackexchange.com
13
Is there a Stack Overflow like site for computer science?
meta.stackexchange.com
9
Examples in which the size of the alphabet ($\geq 2$) used for an encoding matters
cstheory.stackexchange.com
7
Do many-one reductions and Turing reductions define the same class NPC
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
meta.stackexchange.com