Seminar
| Speaker: | Yiannis N. Moschovakis (Επίτιμος Καθηγητής, Τμήμα μαθηματικών ΕΚΠΑ, ΕΚΠΑ) |
|---|---|
| Title: | The complexity of Euclid's algorithm |
| Date: | Παρασκευή, 05 Οκτ 2001 |
| Ώρα: | 18:00-19:00 |
This is a static snapshot of the website of MPLA, taken on 2025-02-27.
| You are here: Seminars » 2001-2002 » Y. N. Moschovakis, 2001-10-05 |
Reporter
Web standards:
XHTML1.0, CSS3.
© 1996 – 2018
MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.
Contact the webmaster.
Comments