Christian Engels
Christian Engels
NII
Bestätigte E-Mail-Adresse bei cs.uni-saarland.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Average-case approximation ratio of the 2-opt algorithm for the TSP
C Engels, B Manthey
Operations Research Letters 37 (2), 83-84, 2009
352009
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits
S Chillara, C Engels, N Limaye, S Srinivasan
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
132018
On expressing majority as a majority of majorities
C Engels, M Garg, K Makino, A Rao
SIAM Journal on Discrete Mathematics 34 (1), 730-741, 2020
92020
Random shortest paths: Non-euclidean instances for metric optimization problems
K Bringmann, C Engels, B Manthey, BVR Rao
Algorithmica 73 (1), 42-62, 2015
82015
Random shortest paths: non-euclidean instances for metric optimization problems
K Bringmann, C Engels, B Manthey, BVR Rao
Algorithmica 73 (1), 42-62, 2015
82015
Random shortest paths: Non-euclidean instances for metric optimization problems
K Bringmann, C Engels, B Manthey, BVR Rao
Algorithmica 73 (1), 42-62, 2015
82015
Randomness efficient testing of sparse black box identities of unbounded degree over the reals
M Bläser, C Engels
Symposium on Theoretical Aspects of Computer Science (STACS2011) 9, 555-566, 2011
62011
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
C Engels
J. Graph Algorithms Appl. 1, 3-22, 2016
42016
Dichotomy theorems for homomorphism polynomials of graph classes
C Engels
International Workshop on Algorithms and Computation, 282-293, 2015
42015
Why are certain polynomials hard?: A look at non-commutative, parameterized and homomorphism polynomials
C Engels
Saarbrücken, Universität des Saarlandes, Diss., 2016
32016
New Algorithms and Hard Instances for Non-Commutative Computation
C Engels, BV Rao
arXiv preprint arXiv:1409.0742, 2014
22014
Observations on Symmetric Circuits
C Engels
arXiv preprint arXiv:2007.07496, 2020
2020
Lower Bounds of Algebraic Branching Programs and Layerization
C Engels
arXiv preprint arXiv:2007.06819, 2020
2020
On hard instances of non-commutative permanent
C Engels, BVR Rao
Discrete Applied Mathematics 277, 127-138, 2020
2020
Parameterized Valiant's Classes
M Bläser, C Engels
arXiv preprint arXiv:1907.12287, 2019
2019
Exponential lower bounds for some depth five powering circuits
S Chillara, C Engels, BVR Rao, R Saptharishi, K Sreenivasaiah
2018
On\varSigma\wedge\varSigma\wedge\varSigma Circuits: The Role of Middle\varSigma Fan-In, Homogeneity and Bottom Degree
C Engels, BVR Rao, K Sreenivasaiah
International Symposium on Fundamentals of Computation Theory, 230-242, 2017
2017
Lower Bounds for Projections of Power Symmetric Polynomials
C Engels, BVR Rao, K Sreenivasaiah
Electronic Colloquium on Computational Complexity (ECCC): Report Series 153 …, 2016
2016
Random shortest path metrics with applications
C Engels, B Manthey, BVR Rao
11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW …, 2012
2012
Revisiting Lower Bounds for Multi-r-ic Depth Four Circuits
S Chillara, C Engels
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20