Literaturverzeichnis
| [AB09] | Sanjeev Arora und Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. |
| [ABB97] | Jean-Michel Autebert, Jean Berstel und Luc Boasson. Context-Free Languages and Pushdown Automata, Seiten 111–174. Springer, 1997. |
| [ADG12] | Greg Aloupis, Erik D. Demaine und Alan Guo. Classic nintendo games are (np-)hard. CoRR, abs/1203.1895, 2012. |
| [AFMZ00] | Jürgen Alex, Hermann Flessner, Wilhelm Mons und Horst Zuse. Der Vater des Computers. Parzeller, 2000. |
| [AKS04] | Manindra Agrawal, Neeraj Kayal und Nitin Saxena. Primes is in p. Annals of Mathematics, 160:781–793, 2004. |
| [Aro98] | Sanjeev Arora. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. ... |
Get Theoretische Informatik - ganz praktisch now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
