Computational Complexity and Numerical Stability of Linear Problems

Computational Complexity and Phase Transitions

Computational complexity of reconstruction and isomorphism testing for designs and line graphs

Computational Complexity on Signed Numbers

Computational Hardness of Enumerating Satisfying Spin-Assignments in Triangulations

Computational Power of P Systems with Small Size Insertion and Deletion Rules

Computational Processes and Incompleteness

Computational Transition at the Uniqueness Threshold

Computer Runtimes and the Length of Proofs: On an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving

Computing Bits of Algebraic Numbers

Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones

Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications

Computing hypergraph width measures exactly

Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

Computing Multi-Homogeneous Bezout Numbers is Hard

Computing Multiplicities of Lie Group Representations

Computing Nash Equilibria: Approximation and Smoothed Complexity

Computing over the Reals: Foundations for Scientific Computing

Computing the Solutions of the Combined Korteweg-de Vries Equation by Turing Machines

Computing without memory