Complexity of Computer Computations pp 85-103 | Cite as

# Reducibility among Combinatorial Problems

- 4k Citations
- 7 Mentions
- 1.5k Downloads

## Abstract

A large class of computational problems involve the determination of properties of graphs, digraphs, integers, arrays of integers, finite families of finite sets, boolean formulas and elements of other countable domains. Through simple encodings from such domains into the set of words over a finite alphabet these problems can be converted into language recognition problems, and we can inquire into their computational complexity. It is reasonable to consider such a problem satisfactorily solved when an algorithm for its solution is found which terminates within a number of steps bounded by a polynomial in the length of the input. We show that a large number of classic unsolved problems of covering, matching, packing, routing, assignment and sequencing are equivalent, in the sense that either each of them possesses a polynomial-bounded algorithm or none of them does.

## Keywords

Polynomial Time Turing Machine Regular Expression Combinatorial Problem Finite Alphabet## Preview

Unable to display preview. Download preview PDF.