FCT 1993: Difference between revisions
No edit summary |
No edit summary |
||
| Line 13: | Line 13: | ||
}} | }} | ||
The 9th Fundamentals of Computation Theory (FCT) 1993 | The 9th Fundamentals of Computation Theory (FCT) 1993 | ||
==Topics== | |||
- Semantics and logical concepts in the theory of computing and formal specification | |||
- Automata and formal languages | |||
- Computational geometry, algorithmic aspects of algebra and algebraic geometry, | |||
cryptography | |||
- Complexity (sequential, parallel, distributed computing, structure, lower | |||
bounds, complexity of analytical problems, general concepts) | |||
- Algorithms (efficient, probabilistic, parallel, sequential, distributed) | |||
- Counting and combinatorics in connection with mathematical computer science | |||
Revision as of 11:20, 2 March 2021
| FCT 1993 | |
|---|---|
9th Fundamentals of Computation Theory
| |
| Ordinal | 9 |
| Event in series | FCT |
| Dates | 1993/08/23 (iCal) - 1993/08/27 |
| Location | |
| Location: | Szeged, Hungary |
| Table of Contents | |
The 9th Fundamentals of Computation Theory (FCT) 1993
Topics
- Semantics and logical concepts in the theory of computing and formal specification - Automata and formal languages - Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts) - Algorithms (efficient, probabilistic, parallel, sequential, distributed) - Counting and combinatorics in connection with mathematical computer science