New Proof: P = NP !

Started by
9 comments, last by gumby 21 years, 2 months ago
quote:Original post by cedricl
I haven''t, but I''m interested in that kind of stuff, and since I''m doing a B. Sc. in maths-phys, I won''t learn it at school.

Fruny, what kind of textbook are you using in these classes? Can you give me a few references?


We''ve been using "Introduction to Theory of Computation" by Sipser, but it''s only so-so, and kinda expensive.

quote:Original post by Anonymous Poster
However nondeterministic Turing Machines are not infinitely parallel, nor are they quantum. The class of problems efficiently solvable on a quantum computer (usually the class BQP is considered) is not known and probably has very little relationship with NP.


Ok.

[ Start Here ! | How To Ask Smart Questions | Recommended C++ Books | C++ FAQ Lite | Function Ptrs | CppTips Archive ]
[ Header Files | File Format Docs | LNK2001 | C++ STL Doc | STLPort | Free C++ IDE | Boost C++ Lib | MSVC6 Lib Fixes ]
"Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it." — Brian W. Kernighan

This topic is closed to new replies.

Advertisement