Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity




Christian Engels

I was a PhD student in the computational complexity group at Saarland University and I am now working at Tokyo Institute of Technology

My main interest arithmetic circuit complexity.

Some Publications

[P3]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.
Mathematical Foundations of Computer Science (MFCS), 8087:219-230, 2013.
Markus Bläser, Christian Engels.
Randomness efficient testing of Sparse Black Box Identities of Unbounded Degree over the Reals.
Symposium on Theoretical Aspects of Computer Science (STACS 2011).
Christian Engels, Bodo Manthey.
Average-case approximation ratio of the 2-opt algorithm for the TSP
Operations Research Letters 37:2 pages 83-84, (2009).