Normal view MARC view ISBD view

Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity - 1. - New York, NY Springer New York 2010.

Mathematics and Statistics (Springer-11649)

ISBN: 9780387684413, 978-0-387-68441-3

Subjects--Topical Terms:
Algorithm Analysis and Problem Complexity
Algorithms
Algorithms
Computation by Abstract Devices
Computer science
Computer software
Information theory
Mathematics
Mathematics
Theory of Computation

Dewey Class. No.: 518.1, / 23

Place hold
Print
Cite
Add to your cart (remove)
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)