![]() |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
All CFPs on WikiCFP | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Present CFP : 2025 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
TAMC 2025 aims at bringing together a wide range of researchers with interest in computational theory, information theory and applications.
The main themes of the conference are computability, complexity, algorithms, information theory and their extensions to machine learning theory, and foundations of artificial intelligence. Submission Link: https://easychair.org/conferences/?conf=tamc2025 The topics of interest include (but are not limited to) the following: Computational complexity and algorithms Models of computation Automata theory and formal languages Quantum computing Algorithmic game theory Cryptography and data security Computational biology and bioinformatics Parallel and distributed computing Formal verification and program analysis Computational geometry and graph theory Logic and proof theory Computational social choice Combinatorial optimization | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|