piecing together complexity  to illustrate the "remarkable extent to which complexity theory operates by means of analogs from computability theory," richard karp created this conceptual map or jigsaw puzzle. to lay out the puzzle in the plane, he used a "graph planarity algorithm." the more distantly placed parts might not at first seem related, "but in the end, the theory of np-completeness does bring them all together," karp says.  the upper right portion of the puzzle shows concepts related to combinatorial explosions and the notion of a "good" or "efficient" algorithm. in turn, "complexity" connects these concepts to the upper left portion, which represents the concerns of early computability theorists.  the traveling salesman problem is closer to the upper right corner because it is probably intractable. it therefore borders on "np-completeness" and "combinatorial explosion."  to some extent, however, certain divisions blur. "linear programming," for example, has an anomalous status---the most widely used algorithms for solving such problems in practice are not good in the theoretical sense, and those that are good in the theoretical sense are often not good in practice. one example is the ellipsoid method that was the object of so much attention six years ago. it ran in polynomial time, but the polynomial was of such a high degree that the method proved good in the technical sense, but ineffective in practice. "the reason is that our notion of polynomial-time algorithms doesn't exactly capture the notion of an intuitively efficient algorithm," karp explains. "when you get up to n5 or n6, then it's hard to justify saying that it is really efficient. so edmonds's concept of a good algorithm isn't quite a perfect formal counterpart of good in the intuitive sense." further, the simplex algorithm is good in every practical sense, karp says, but not good according to the standard paradigm of complexity theory. the most recent addition to linear programming solutions, an algorithm devised by narendra karmarkar that some think challenges the simplex algorithm, is good in the technical sense and also appears to be quite effective in practice, says karp.  the good algorithm segment is adjacent to "heuristics" because a heuristic algorithm may work well, but lack a theoretical pedigree. some heuristic algorithms are always fast, but sometimes fail to give good solutions. others always give an optimal solution, but are not guaranteed to be fast. the simplex algorithm is of the latter type.  "undecidability, " "combinatorial explosion," and "complexity" are on the same plane because they are analogs of one another; undecidability involves unbounded search, whereas combinatorial explosions are by definition very long but not unbounded searches. complexity theory bridges the gap because, instead of asking whether a problem can be solved at all, it poses questions about the resources needed to solve a problem.  the lower left region contains the segments karp has been concerned with most recently and that contain open-ended questions. "randomized algorithm," for example, is situated opposite "probabilistic analysis" because both are alternatives to worst-case analyses of deterministic algorithms. randomized algorithms might be able to solve problems in polynomial time that deterministic ones cannot and that could mean an extension of the notion of good algorithms. perhaps through software designs for non-von neumann machines, algorithms can be made more efficient in practice through parallelism. finally, some parts of the puzzle are not yet defined. says karp, "they correspond to the unknown territory that remains to be explored in the future."  karen a. frenkel