tags:

views:

32

answers:

1
Q: 

I need a book where can I find a lot of reductions

Hi all, do you know a book where there are proofs of reductions between different problems? I have the papadimitriou and others but there are only a few reductions..

Thanks in advance,

bye

A: 

The classic book is "Computers and Intractability" by Garey and Johnson. It has hundreds of reductions.

Aaron  2010-07-05 17:47:31

related questions

How much to log within an application??? How much is too much...
Is list::size() really O(n)?
multiset, map and hash map complexity
C++ STL: Container Recreation or Reuse after clearing?
How do I find the running time given algorithm speed and computer speed?
Dealing with complexity
Recursion and Big O
Efficient traversal of a changelist
Constant Amortized Time
In-memory LINQ performance
which tools are helpful in determining the cyclomatic complexity of a given C source code
Hashtable in C++?
What is Big O notation? Do you use it?
Tool for calculating cyclomatic complexity
What is the time complexity of indexing, inserting and removing from common data structures?
Did you apply computational complexity theory in real life?
What's "P=NP?", and why is it such a famous question?
How do you prevent over complicated solutions or designs?
Prim's Algorithm, Priority First Search and Minimum Spanning Trees (MST)
What level of complexity requires a framework?
Where can I find the time and space complexity of the built-in sequence types in Python
Complexity of Regex substitution
What tools do you use for static code analysis?
What's your/a good limit for cyclomatic complexity?
Big O, how do you calculate/approximate it?