[Search for users]
[Overall Top Noters]
[List of all Conferences]
[Download this site]
| Title: | Mathematics at DEC |
|
| Moderator: | RUSURE::EDP |
|
| Created: | Mon Feb 03 1986 |
| Last Modified: | Fri Jun 06 1997 |
| Last Successful Update: | Fri Jun 06 1997 |
| Number of topics: | 2083 |
| Total number of notes: | 14613 |
1337.0. "Discussion on NP hard/complete problems" by XANADU::BISWAS () Tue Nov 13 1990 09:12
Hi,
I am preparing for my Ph.D comprehensive exam and finding the NP-complete
proofs as difficult as I used to find them when I was back in school. When
you have to show that a given problem is NP-hard you have to reduce a
known NP-hard problem to the given problem. That process is usually not
straight forward.
Is there anybody in the ZKO/Nashua area who is interested in these problems
and have the time and energy to discuss these problems with me? I am sure
there are algorithms "gurus" around here! Help!!
Thanks,
Prabuddha Biswas
| T.R | Title | User | Personal
Name | Date | Lines
|
|---|