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.
2.7 Summary and Bibliographic Remarks
H. Anton. Elementary Linear Algebra. John Wiley and Sons, New York, eighth edition, 2000.
A. Brandstädt, V. Le, and J. Spinrad. Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1999.
T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press and McGraw-Hill, second edition, 2001.
W. Feller. Introduction to Probability Theory and its Applications, volume 1. John Wiley and Sons, 1968.
M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
F. Harary. Graph Theory. Addison-Wesley, 1969.
J. Hopcroft, R. Motwani, and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, second edition, 2001.
S. Homer and A. Selman. Computability and Complexity Theory. Texts in Computer Science. Springer-Verlag, 2001.
G. Hardy and E. Wright. An Introduction to the Theory of Numbers. Clarendon Press, Oxford, 5th edition, 1979.
N. Jacobson. Basic Algebra I. W. H. Freeman, 1974.
S. Kleene. Introduction to Metamathematics. D. van Nostrand Company, Inc., New York and Toronto, 1952.
P. Odifreddi. Classical Recursion Theory. North-Holland, 1989.
T. Ottmann and P. Widmayer. Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag, Heidelberg, Berlin, fourth edition, 2002. In German.
C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
H. Rogers, Jr. The Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.
K. Rosen. Elementary Number Theory and its Applications. Addison-Wesley, 1999.
M. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114–125, 1959.
A. Salomaa. Formal Languages. Academic Press, 1973.
U. Schöning. Algorithmik. Spektrum Akademischer Verlag, Heidelberg, Berlin, 2001. In German.
U. Schöning. Logik für Informatiker. Spektrum Akademischer Verlag, Heidelberg, Berlin, 1995. In German.
J. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.
A. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, ser. 2, 42:230–265, 1936. Correction, ibid, vol. 43, pp. 544–546, 1937.
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2005). Foundations of Computer Science and Mathematics. In: Complexity Theory and Cryptology. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28520-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-28520-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22147-0
Online ISBN: 978-3-540-28520-5
eBook Packages: Computer ScienceComputer Science (R0)