Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
maschka
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
22
votes
Many-one reductions vs. Turing reductions to define NPC
cc.complexity-theory
np-hardness
reductions
asked Aug 17 '10 at 12:58
cstheory.stackexchange.com
15
votes
Avalanche like stochastic process
pr.probability
markov-chains
stochastic-process
asked Nov 7 '10 at 17:49
cstheory.stackexchange.com
7
votes
Why are these two definitions of PPAD equivalent?
cc.complexity-theory
complexity-classes
ppad
asked Oct 17 '10 at 14:19
cstheory.stackexchange.com
Top Answers
26
Complexity of simplex algorithm
cstheory.stackexchange.com
21
A simple approximation algorithm for the TSP
cstheory.stackexchange.com
16
Problems Between P and NPC
cstheory.stackexchange.com
9
Is there a Stack Overflow like site for computer science?
meta.stackoverflow.com
8
Examples in which the size of the alphabet ($\geq 2$) used for an encoding matters
cstheory.stackexchange.com
5
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.stackoverflow.com
