Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Matters Computational - Ideas, Algorithms, Source Code

Matters Computational

Ideas, Algorithms, Source Code

Arndt, Jörg

2011, XIV, 978p. 475 illus..

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-642-14764-7

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-642-14763-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • Complete solutions with source code, examples, and illustrations
  • Includes material that is either rarely covered elsewhere or completely new
  • Software is supplied online, including the examples
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.

Content Level » Professional/practitioner

Keywords » Algorithms - Arithmetic - Combinatorics - Finite fields - Fourier transform

Related subjects » Theoretical Computer Science

Table of contents 

Low level algorithms.- Bit wizardry.- Permutations and their operations.- Sorting and searching.- Data structures.- Combinatorial generation.- Conventions and considerations.- Combinations.- Compositions.- Subsets.- Mixed radix numbers.- Permutations.- Multisets.- Gray codes for string with restrictions.- Parenthesis strings.- Integer partitions.- Set partitions.- Necklaces and Lyndon words.- Hadamard and conference matrices.- Searching paths in directed graphs.- Fast transforms.- The Fourier transform.- Convolution, correlation, and more FFT algorithms.- The Walsh transform and its relatives.- The Haar transform.- The Hartley transform.- Number theoretic transforms (NTTs).- Fast wavelet transforms.- Fast arithmetic.- Fast multiplication and exponentiation.- Root extraction.- Iterations for the inversion of a function.- The AGM, elliptic integrals, and algorithms for computing.- Logarithm and exponential function.- Computing the elementary functions with limited resources.- Numerical evaluation of power series.- Cyclotomic polynomials, product forms, and continued fractions.- Synthetic Iterations.-. Algorithms for finite fields.- Modular arithmetic and some number theory.- Binary polynomials.- Shift registers.- Binary finite fields.- The electronic version of the book.- Machine used for benchmarking.- The GP language.- Bibliography.- Index.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.