Difference between revisions of "FCT 1993"
Jump to navigation
Jump to search
| Line 18: | Line 18: | ||
*Automata and formal languages | *Automata and formal languages | ||
*Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography | *Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography | ||
| − | *Complexity (sequential, parallel, distributed computing, structure, lower | + | *Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts) |
| − | bounds, complexity of analytical problems, general concepts) | ||
*Algorithms (efficient, probabilistic, parallel, sequential, distributed) | *Algorithms (efficient, probabilistic, parallel, sequential, distributed) | ||
*Counting and combinatorics in connection with mathematical computer science | *Counting and combinatorics in connection with mathematical computer science | ||
Revision as of 13:21, 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