Matters computational: Ideas, algorithms, source code

39Citations
Citations of this article
65Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Fourier transform, and fast arithmetic for both real numbers and finite fields. Various optimization techniques are described and the actual performance of many given implementations is examined. The focus is on material that does not usually appear in textbooks on algorithms. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms such as the Linux and BSD operating systems. © Springer-Verlag Berlin Heidelberg 2011. All rights are reserved.

Cite

CITATION STYLE

APA

Arndt, J. (2011). Matters computational: Ideas, algorithms, source code. Matters Computational: Ideas, Algorithms, Source Code (pp. 1–966). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-14764-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free