MHB NP-Complete Problems to Reading and Understanding

  • Thread starter Thread starter mathmari
  • Start date Start date
Click For Summary
Recommended readings for understanding NP-complete problems include "Elements of the Theory of Computation" by Lewis and Papadimitriou, "Introduction to the Theory of Computation" by Sipser, and "Introduction to Automata Theory, Languages, and Computation" by Hopcroft, Motwani, and Ullman. These texts are well-regarded in the field of theoretical computer science. The discussion confirms these recommendations as suitable for gaining a solid foundation in the topic. Engaging with these books will enhance comprehension of NP-completeness and related concepts.
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

What book would you recommend me to read about NP-complete problems?? (Wondering)
 
Mathematics news on Phys.org
mathmari said:
What book would you recommend me to read about NP-complete problems?
The same books on theory of computation I recommended on other occasions.
 
Evgeny.Makarov said:
The same books on theory of computation I recommended on other occasions.

Do you mean these ones:

[1] Lewis, Papadimitriou. Elements of the Theory of Computation. 2nd edition.

[2] Sipser. Introduction to the Theory of Computation. 2nd edition.

[3] Hopcroft, Motwani, Ullman. Introduction to Automata Theory, Languages, and Computation. 2nd edition.

?? (Wondering)
 
Precisely.
 
Ok! Thank you! (Smile)
 

Thread 'Area of Overlapping Squares'

Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?
View full post »

Similar threads

Insights The History and Importance of the Riemann Hypothesis
  • · Replies 0 ·
Replies
0
Views
3K
Will P Ever Equal NP as Technology Advances?
  • · Replies 5 ·
Replies
5
Views
3K
The Subset Multiply Problem: Is it NP Complete?
  • · Replies 2 ·
Replies
2
Views
3K
Protein Folding and NP-Completeness
  • · Replies 5 ·
Replies
5
Views
3K
Undergrad Are electrons universal problem solvers?
  • · Replies 4 ·
Replies
4
Views
1K
Insights How to Write a Math Proof and Their Structure
  • · Replies 2 ·
Replies
2
Views
3K
Graduate How to simulate an isotope shift measurement
  • · Replies 1 ·
Replies
1
Views
2K
Insights P vs. NP conjecture and what is a Turing Machine (TM)?
  • · Replies 6 ·
Replies
6
Views
3K
What makes a problem computationally NP?
  • · Replies 10 ·
Replies
10
Views
3K
MHB Is HSC NP-Complete in Graph Theory?
  • · Replies 1 ·
Replies
1
Views
2K