CIDEC ÜIK |
Estonian Winter Schools in Computer Science Eesti arvutiteaduse talvekoolid |
EWSCS 2004 EATTK 2004 |

IX Eesti Arvutiteaduse Talvekool (EATTK)

February 29 - March 5, 2004

Institute of Mathematics and Computer Science

University of Latvia

Riga, Latvia

There is no wonder when elementary mathematics is used in Computer Science. However many examples show that some results of the mathematics of 19th and 20th century originally belonging to the "pure mathematics" later become crucially important for extremely practical problems of Computer Science. The most well-known example is the usage of Number Theory in Cryptography. However there are many more such examples. We consider:

- Riemann hypothesis and its impact to Theoretical Computer Science;
- Hilbert's theorem on basis, and decidability of equivalence problem for deterministic Lindenmayer systems;
- Fourier transform and its usage to prove lower bounds of complexity;
- p-adic numbers and factorisation of polynomials.

Riemann hypothesis

Invariants, Hilbert and Lindenmayer

Hilbert's Nullstellensatz

Fourier transform

p-adic numbers

http://www.cs.ioc.ee/yik/schools/win2004/

Modified Thursday, Jan 01, 1970 at 2:00 EET+0200 by monika(at)cs.ioc.ee