Part of the Algorithms and Combinatorics 21 book series (AC, volume 21)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


General Literature

  1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974MATHGoogle Scholar
  2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M. [1999]: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin 1999MATHGoogle Scholar
  3. Bovet, D.B., and Crescenzi, P. [1994]: Introduction to the Theory of Complexity. Prentice-Hall, New York 1994Google Scholar
  4. Garey, M.R., and Johnson, D.S. [1979]: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Chapters 1-3, 5, and 7Google Scholar
  5. Horowitz, E., and Sahni, S. [1978]: Fundamentals of Computer Algorithms. Computer Science Press, Potomac 1978, Chapter 11MATHGoogle Scholar
  6. Johnson, D.S. [1981]: The NP-completeness column: an ongoing guide. Journal of Algorithms starting with Vol. 4 (1981)Google Scholar
  7. Karp, R.M. [1975]: On the complexity of combinatorial problems. Networks 5 (1975), 45–68MathSciNetMATHGoogle Scholar
  8. Papadimitriou, C.H. [1994]: Computational Complexity. Addison-Wesley, Reading 1994MATHGoogle Scholar
  9. Papadimitriou, C.H., and Steiglitz, K. [1982]: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Chapters 15 and 16MATHGoogle Scholar
  10. Wegener, I. [2005]: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Berlin 2005MATHGoogle Scholar

Cited References

  1. Adleman, L.M., Pomerance, C., and Rumely, R.S. [1983]: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117 (1983), 173–206MathSciNetGoogle Scholar
  2. Agrawal, M., Kayal, N., and Saxena, N. [2004]: PRIMES is in P. Annals of Mathematics 160 (2004), 781–793MathSciNetCrossRefMATHGoogle Scholar
  3. Cook, S.A. [1971]: The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971), 151–158Google Scholar
  4. Edmonds, J. [1965]: Minimum partition of a matroid into independent subsets. Journal of Research of the National Bureau of Standards B 69 (1965), 67–72MathSciNetMATHGoogle Scholar
  5. van Emde Boas, P. [1990]: Machine models and simulations. In: Handbook of Theoretical Computer Science; Volume A; Algorithms and Complexity (J. van Leeuwen, ed.), Elsevier, Amsterdam 1990, pp. 1–66Google Scholar
  6. Hopcroft, J.E., and Ullman, J.D. [1979]: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading 1979MATHGoogle Scholar
  7. Karp, R.M. [1972]: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, eds.), Plenum Press, New York 1972, pp. 85–103Google Scholar
  8. Ladner, R.E. [1975]: On the structure of polynomial time reducibility. Journal of the ACM 22 (1975), 155–171CrossRefMathSciNetMATHGoogle Scholar
  9. Lewis, H.R., and Papadimitriou, C.H. [1981]: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs 1981MATHGoogle Scholar
  10. Pratt, V. [1975]: Every prime has a succinct certificate. SIAM Journal on Computing 4 (1975), 214–220MathSciNetMATHGoogle Scholar
  11. Schönhage, A., and Strassen, V. [1971]: Schnelle Multiplikation großer Zahlen. Computing 7 (1971), 281–292MATHGoogle Scholar
  12. Turing, A.M. [1936]: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (2)42 (1936), 230–265 and 43 (1937), 544-546MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Personalised recommendations