Part of the Algorithms and Combinatorics book series (AC, volume 21)
Let us start with two examples.
KeywordsPolynomial Time Combinatorial Optimization Problem Elementary Step Input Size Complete Enumeration
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Cobham, A. : The intrinsic computational difficulty of functions. Proceedings of the 1964 Congress for Logic Methodology and Philosophy of Science (Y. Bar-Hillel, ed.), North-Holland, Amsterdam 1964, pp. 24–30Google Scholar
© Springer-Verlag Berlin Heidelberg 2002