- Home
- Academic
- Computer science
- Algorithmics, complexity, computer algebra and computational geometry
- Series
Cambridge Tracts in Theoretical Computer Science
This series offers books on theoretical computer science, that part of computer science concerned with fundamental mathematical questions about computers, programs, algorithms, data, and information processing systems in general. Computers and programs are inherently mathematical objects, and an understanding of their mathematical basis is essential to the appreciation of the foundations of computer science. The series covers the complete field of theoretical computer science, including mathematical foundations of computer science, formal methods of reasoning about programs and data, and formal semantics of programs and data, including formal semantics for natural language, pictures, and sound.
Associate Editor: S. Abramsky, Oxford University
Editorial Board: P. H. Aczel, University of Manchester; Y. Gurevich, Microsoft Research; J. V. Tucker, Swansea University
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×