This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Kapitel 7
M. R. Garey und D. S. Johnson, Computers and Intractability: A Guide to NP-Complete-ness, W. H. Freeman & Co., 1979.
M. D. Davis, R. Sigal und E. J. Weyuker, Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, 2. Auflage, Academic Press, 1994.
J. E. Hopcroft, R. Motwani und J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 2. Auflage, Addison-Wesley, 2001.
E. Horowitz, S. Sahni und S. Rajasekaran, Computer Algorithms, Computer Science Press, 1997.
E. V. Krishnamurthy, Introductory Theory of Computer Science, Springer-Verlag, 1983.
H. R. Lewis und C. H. Papadimitriou, Elements of the Theory of Computation, 2. Auflage, Prentice-Hall, 1997.
M. Machtey und P. Young, An Introduction to the General Theory of Algorithms, North Holland, Amsterdam, 1978.
K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, Springer-Verlag, 1984.
C. H. Papadimitriou und K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1982.
C. H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
H. R. Lewis und C. H. Papadimitriou, „The Efficiency of Algorithms,“ Scientific American 238:1 (1978), S. 96–109.
L. J. Stockmeyer und A. K. Chandra, „Intrinsically Difficult Problems,“ Scientific American 240:5 (1979), S. 140–59.
M. O. Rabin, „Complexity of Computations,“ Comm. Assoc. Comput. Mach. 20 (1977), S. 625–33.
S. A. Cook, „An Overview of Computational Complexity,“ Comm. Assoc. Comput. Mach. 26 (1983), S. 401–8.
R. M. Karp, „Combinatorics, Complexity, and Randomness,“ Comm. Assoc. Comput. Mach. 29 (1986), S. 98–109.
D. S. Johnson, „A Catalog of Complexity Classes,“ in Handbook of Theoretical Computer Science Vol. A, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 67–161.
M. O. Rabin, „Degree of Difficulty of Computing a Function and a Partial Ordering of Recursive Sets,“ Technical Report No. 2, Hebrew University, Branch of Applied Logic, Jerusalem, 1960.
A. Cobham, „The Intrinsic Computational Difficulty of Functions,“ Proc. 1964 Int. Congress for Logic, Methodology, and Phil. of Sci., Y. Bar-Hillel, Hrsg., North Holland, S. 24–30,1965.
J. Edmonds, „Paths, Trees, and Flowers,“ Canad. J. Math. 17 (1965), S. 449–67.
J. Hartmanis und R. E. Stearns, „On the Computational Complexity of Algorithms,“ Trans. Amer. Math. Soc. 117 (1965), S. 285–306.
M. Blum, „A Machine Independent Theory of the Complexity of Recursive Functions,“ J. Assoc. Comput. Mach. 14 (1967), S. 322–36.
S. A. Cook, „The Complexity of Theorem Proving Procedures,“ Proc. 3rd ACM Symp. on Theory of Computing, ACM Press, S. 151–8, 1971.
L. A. Levin, „Universal Search Problems,“ Problemy Peredaci Informacii 9 (1973), S. 115–16 (russisch). Englische Übersetzung Problems of Information Transmission 9 (1973), S. 265–6.
R. M. Karp, „Reducibility Among Combinatorial Problems,“ in Complexity of Computer Computations, R. E. Miller und J. W. Thatcher, Hrsg., Plenum Press, S. 85–104, 1972.
C. H. Papadimitriou, „The Euclidean Traveling Salesman Problem is NP-Complete,“ Theor. Comput. Sci. 4 (1977), S. 237–44.
S. Even, A. Itai und A. Shamir, „On the Complexity of Timetable and Multicommodity Flow Problems,“ SIAM J. Comput. 5 (1976), S. 691–703.
W. S. Baring-Gould und C. Baring-Gould, Annotated Mother Goose, Clarkson N. Potter, 1962.
V. R. Pratt, „Every Prime has a Succint Certificate,“ SIAM J. Comput. 4 (1975), S. 214–20.
M. Agrawal, N. Kayal und N. Saxena, „PRIMES is in P,“ Preprint, August 2002.
M. Agrawal, N. Kayal und N. Saxena, „PRIMES is in P,“ Annals of Mathematics, 160 (2004), S. 781–93.
V. V. Vazirani, Approximation Algorithms, Springer-Verlag, 2001.
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela und M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer-Verlag, 1999.
Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, Hrsg., Brooks Cole, 1996.
R. M. Karp, „The Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane,“ Math. Oper. Res. 2 (1977), S. 209–24.
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E. L. Lawler et al., Hrsg., John Wiley & Sons, 1985.
U. Feige, S. Goldwasser, L. Lovász, S. Safra und M. Szegedy, „Approximating Clique is Almost NP-Complete,“ J. Assoc. Comput. Mach., 43 (1996), S. 268–92.
S. Arora und S. Safra, „Probabilistic Checking of Proofs: A New Characterization of NP,“. Assoc. Comput. Mach., 45 (1998), S. 70–122.
S. Arora, C. Lund, R. Motwani, M. Sudan und M. Szegedy, „Proof Verification and Intractability of Approximation Problems,“ J. Assoc. Comput. Mach. 45 (1998), S. 501–55.
M. R. Garey und D. S. Johnson, „The Complexity of Near-Optimal Graph Coloring,“. Assoc. Comput. Mach. 23 (1976), S. 43–9.
A. R. Meyer und L. J. Stockmeyer, „The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Time,“ Proc. 13th Ann. Symp. on Switching and Automata Theory, IEEE Press, S. 125–9,1972.
A. S. Fraenkel und D. Lichtenstein, „Computing a Perfect Strategy for n×n Chess Requires Time Exponential in n“ J. Combinatorial Theory, Reihe A31 (1981), S. 199–214.
J. M. Robson, „N by N Checkers is Exptime Complete,“ SIAM J. Comput. 13 (1984), S. 252–67.
L. J. Stockmeyer und A. K. Chandra, „Provably Difficult Combinatorial Games,“ SIAM J. Comput. 8 (1979), S. 151–74.
M. J. Fischer und R. E. Ladner, „Propositional Dynamic Logic of Regular Programs,“. Comput. Syst. Sci. 18 (1979), S. 194–211.
M. J. Fischer und M. O. Rabin, „Super-Exponential Complexity of Presburger Arithmetic,“ in Complexity of Computation, R. M. Karp, Hrsg., Amer. Math. Soc, Providence, RI, S. 27–1, 1974.
A. R. Meyer, „Weak Monadic Second Order Theory of Successor is not Elementary Recursive,“ in Logic Colloquium, R. Parikh, Hrsg., Lecture Notes in Mathematics, Vol. 453, Springer-Verlag, S. 132–54. 1975.
J. Ferrante und C. W. Rackoff, The Computational Complexity of Logical Theories, Lecture Notes in Mathematics, Vol. 718, Springer-Verlag, 1979.
G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, 1963.
L. G. Khachiyan, „A Polynomial Algorithm in Linear Programming,“ Doklady Akademiia Nauk SSSR 244 (1979), S. 1093–6 (russisch). Englische Übersetzung in Soviet Mathematics Doklad 20 (1979), S. 191–4.
N. Karmarkar, „A New Polynomial-Time Algorithm for Linear Programming,“ Combinatorial 4 (1984), S. 373–95.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Ineffizienz und Unhandhabbarkeit. In: Algorithmik. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-37437-X_7
Download citation
DOI: https://doi.org/10.1007/3-540-37437-X_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24342-7
Online ISBN: 978-3-540-37437-4
eBook Packages: Life Science and Basic Disciplines (German Language)