Richard Karp

Richard Karp , born in 1935 with Boston in Massachusetts, is a Informaticien American, known for its research in Théorie of complexity. He received the Prix Turing in 1985 for this work.

Born from Abraham and Pink Karp with Boston, Massachusetts, Karp has three brothers and sisters: Robert, David and Carolyn. It entered to the Université of Harvard, where it accepted its Bachelor' S dismantles in 1955, its Master' S dismantles in 1956, and its Ph.D. of Mathématiques applied in 1959. He then worked for IBM at the research center Thomas J. Watson. In 1968, he becomes professor of data processing and mathematics to the the University of California, Berkeley, where it will remain then, except for one 4 years period as professor with the Université of Washington. Richard Karp received the National Medal off Science and in 2004 the Médaille Benjamin Franklin in data processing for his work on algorithmic complexity.

He was quoted in the following way during the handing-over of the Turing price: For its continuous contributions to the theory of the algorithms, in particular the development of effective algorithms for the networks and other combinative problems of optimization, identification of calculability in polynomial time with the intuitive concept of effective algorithm, and especially, its contributions to the theory of the Np-complétude. Karp introduced traditional methodology from now on to prove that a problem is Np-complete, which made it possible to identify many practical and theoretical problems as being difficult to calculate.

In 1971 it Co-developed with Jack Edmonds the Algorithme of Edmonds-Karp to solve the problem of maximum flow in the networks, and in 1972 it published an article founder in theory of the complexity, in which it proves the Np-complétude of 21 problems.

In 1987, it Co-developed the Algorithme of Rabin-Karp.

It is currently interested in the Bioinformatique.

Notes and references of the article

Random links: