Best book regarding NP-hard, NP-complete, P =? NP

Posted by RMMMM on Stack Overflow See other posts from Stack Overflow or by RMMMM
Published on 2010-03-26T17:20:13Z Indexed on 2010/03/26 17:23 UTC
Read the original article Hit count: 329

Filed under:

homework

|

np-hard

|

books

What is the best book for a student learning about concepts such as NP-hard, NP-complete and P=?NP?

I've already got the CLR but it doesn't really cover these particular topics as thoroughly.

© Stack Overflow or respective owner

Related posts about homework

parsing a list and producing a structure of that

as seen on Stack Overflow - Search for 'Stack Overflow'
;; structure representing homework points ;; nr: number - the number of the homework ;; points: number - the number of points reached (define-struct homework (nr points)) ;; parse-homework: (list of number pairs) -> (list of homework) ;; The procedure takes a list of number pairs and produces… >>> More
Scheme homework help

as seen on Stack Overflow - Search for 'Stack Overflow'
Okay so I have started a new language in class. We are learning Scheme and i'm not sure on how to do it. When I say learning a new language, I mean thrown a homework and told to figure it out. A couple of them have got me stumped. My first problem is: Write a Scheme function that returns true (the… >>> More
Unix [Homework]: Get a list of /home/user/ directories in /etc/passwd

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm very new to Unix, and currently taking a class learning the basics of the system and its commands. I'm looking for a single command line to list off all of the user home directories in alphabetical order from the /etc/passwd directory. This applies only to the home directories, and not the contents… >>> More
sequential search homework question

as seen on Stack Overflow - Search for 'Stack Overflow'
Consider a disk file containing 100 records a. How many comparisons would be required on the average to find a record using sequential search, if the record is known to be in the file? I figured out that this is 100/2 = 50. b. If the record has a 68% probability of being in the file, how many comparisons… >>> More
[Homework] Online programming editor

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, For a school project i need to write or use a online programming editor. It is a part of a bigger project. I thought of a java application, php/html/javascript or flash. I have a couple of things i could do: Find a good working application and edit it so it works with the rest of the project Find… >>> More

Related posts about np-hard

Best book regarding NP-hard, NP-complete, P =? NP

as seen on Stack Overflow - Search for 'Stack Overflow'
What is the best book for a student learning about concepts such as NP-hard, NP-complete and P=?NP? I've already got the CLR but it doesn't really cover these particular topics as thoroughly. >>> More
3 dimensional bin packing algorithms

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm faced with a 3 dimensional bin packing problem and am currently conducting some preliminary research as to which algorithms/heuristics are currently yielding the best results. Since the problem is NP hard I do not expect to find the optimal solution in every case, but I was wondering: 1) what… >>> More
Minimum cost strongly connected digraph

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a digraph which is strongly connected (i.e. there is a path from i to j and j to i for each pair of nodes (i, j) in the graph G). I wish to find a strongly connected graph out of this graph such that the sum of all edges is the least. To put it differently, I need to get rid of edges in such… >>> More
Deterministic Annealing Code

as seen on Stack Overflow - Search for 'Stack Overflow'
I would like to find an open source example of a code for deterministic annealing. It can be in almost any language: C, C++, MatLab/Octave, Fortran. I have already found a MatLab code for simulated annealing, so MatLab would be best. Here is a paper that describes the algorithm: http://www.google… >>> More
How does heap compaction work quickly?

as seen on Stack Overflow - Search for 'Stack Overflow'
They say that compacting garbage collectors are faster than traditional memory management because they only have to collect live objects, and by rearranging them in memory so everything's in one contiguous block, you end up with no heap fragmentation. But how can that be done quickly? It seems to… >>> More