Advertisement

IV. Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben

  • Joachim von zur Gathen
  • Malte Sieveking
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 43)

Literatur

  1. Bareiss, E.H., Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination, Math. Comp. 22, 103 (1968) 565–578.Google Scholar
  2. Edmonds, J., Systems of Distinct Representatives and Linear Algebra, Journal of Research of the National Bureau of Standards, 71B, 4 (1967) 241–245.Google Scholar
  3. von zur Gathen, J. und Sieveking, M., A Bound on Solutions of Linear Integer Programs, zur Veröffentlichung singereicht.Google Scholar
  4. Karp, R.M., Reducibility among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, New York, 1972.Google Scholar
  5. Mignotte, M., An Inequality about Factors of Polynomials, Math. Comp. 28, 128 (1974) 1153–1157.Google Scholar
  6. Pratt, V.R., Every Prime has a Succinct Certificate, erscheint demnächst.Google Scholar
  7. Tschernikow, S.N., Lineare Ungleichungen, VEB Deutscher Verlag der Wissenschaften, Berlin, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Joachim von zur Gathen
  • Malte Sieveking

There are no affiliations available

Personalised recommendations