Find link

language:

Find link is a tool written by Edward Betts.

searching for richard M. Karp 6 found (66 total)

Computational complexity theory (6,312 words) [view diff] exact match in snippet view article find links to article

1.1.70.4296. doi:10.1109/jproc.2003.814621. Fortnow & Homer (2003) Richard M. Karp, "Combinatorics, Complexity, and Randomness", 1985 Turing Award Lecture

Krishna Palem (2,096 words) [view diff] no match in snippet view article find links to article

University. Avinash Lingamneni; Kirthi Krishna Muntimadugu; Christian Enz; Richard M Karp; Krishna Palem; Christian Piguet. "Algorithmic Methodologies for Ultra-efficient

Knapsack problem (7,666 words) [view diff] exact match in snippet view article find links to article

Report N. 76. NBS Internal report: 18321. Bibcode:1975STIN...7618321W. Richard M. Karp (1972). "Reducibility Among Combinatorial Problems". In R. E. Miller

Physical mapping (1,642 words) [view diff] case mismatch in snippet view article find links to article

Project. Wiley. pp. 234–284. ISBN 978-0-471-22056-5. FARID ALIZADEH; RICHARD M. KARP; DEBORAH K. WEISSER; GEOFFREY ZWEIG (1995). "Physical Mapping of Chromosomes

♯P-completeness of 01-permanent (4,040 words) [view diff] exact match in snippet view article find links to article

Springer-Verlag. p. 2. ISBN 978-3-540-66752-0. Zbl 0948.68082. John E. Hopcroft, Richard M. Karp: An n 5 / 2 {\displaystyle n^{5/2}} Algorithm for Maximum Matchings

Exact cover (4,220 words) [view diff] exact match in snippet view article find links to article

developing the theory, then cataloguing many NP-Complete problems. Richard M. Karp (1972). "Reducibility among combinatorial problems" (PDF). In R.E.