Normal view MARC view ISBD view

Recursion Theory and Computational Complexity

Recursion Theory and Computational Complexity - Berlin, Heidelberg Springer Berlin Heidelberg 2011.

Mathematics and Statistics (Springer-11649)

ISBN: 9783642110726, 978-3-642-11072-6

Subjects--Topical Terms:
Logic, Symbolic and mathematical
Mathematical Logic and Foundations
Mathematics
Mathematics

Dewey Class. No.: 511.3, / 23

Print
Add to your cart (remove)
Suggest for purchase
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)