Computational Theory and Mathematics

This category covers formal foundations of computation, including automata theory, complexity classes, and cryptographic protocols. Research on algorithmic efficiency, discrete structures, and combinatorial optimization is central. Theoretical contributions employing proof-techniques, asymptotic analysis, or new complexity bounds are especially valued. Interdisciplinary work that applies formal methods to systems verification, blockchain technologies, or computational biology is welcome. Papers should enhance understanding of computational limits or propose novel mathematical frameworks underpinning algorithm design.