Complexity of term representations of functions
- Date
- May 12, 2017
- Time
- 1:15 PM - 2:15 PM
- Speaker
- Jakub Opršal
- Affiliation
- TU Dresden, Institut für Algebra
- Language
- en
- Main Topic
- Mathematik
- Other Topics
- Mathematik
- Host
- Dr. E. Lehtonen
- Description
- One way to measure complexity of terms of a finite algebra is to count how many symbols are needed to write down a term describing a particular n-ary term operation, and taking the maximum of these values among all n-ary term operations of the algebra. We will talk about several results about the asymptotics of this sequence. (This is a joint work with E. Aichinger and N. Mudrinski.)
- Links
Last modified: May 5, 2017, 11:19:27 AM
Location
TUD Willers-Bau (WIL C 115)Zellescher Weg12-1401069Dresden
- Homepage
- https://navigator.tu-dresden.de/etplan/wil/00
Organizer
TUD MathematikWillersbau, Zellescher Weg12-1401069Dresden
- Phone
- 49-351-463 33376
- Homepage
- http://tu-dresden.de/mathematik
Scan this code with your smartphone and get directly this event in your calendar. Increase the image size by clicking on the QR-Code if you have problems to scan it.
Legend
- Biology
- Chemistry
- Civil Eng., Architecture
- Computer Science
- Economics
- Electrical and Computer Eng.
- Environmental Sciences
- for Pupils
- Law
- Linguistics, Literature and Culture
- Materials
- Mathematics
- Mechanical Engineering
- Medicine
- Physics
- Psychology
- Society, Philosophy, Education
- Spin-off/Transfer
- Traffic
- Training
- Welcome