Approximation algorithm paper

Thread View: comp.theory

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by David Levine Mon, 11 Jan 1993 22:55

#1936

Author: David Levine
Date: Mon, 11 Jan 1993 22:55

7 lines
908 bytes

Could someone provide a reference (or email address of an author(s)) to the
work by S. Arora, M. Sudan, R. Motwani, C. Lund, and M. Szegedy mentioned in
New Scientist 12/12/92:  "Their result implies that if P != NP, then there is
a threshold beyond which it is just as hard to find a good approximation
algorithm that will always work as it is to find a good solution."

Thanks --dave

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads