×

zbMATH — the first resource for mathematics

Berkholz, Christoph

Compute Distance To:
Author ID: berkholz.christoph Recent zbMATH articles by "Berkholz, Christoph"
Published as: Berkholz, Christoph
External Links: MGP
Documents Indexed: 17 Publications since 2012

Publications by Year

Citations contained in zbMATH Open

12 Publications have been cited 21 times in 15 Documents Cited by Year
Near-optimal lower bounds on quantifier depth and Weisfeiler-Leman refinement steps. Zbl 1394.03052
Berkholz, Christoph; Nordström, Jakob
4
2016
Tight lower and upper bounds for the complexity of canonical colour refinement. Zbl 1362.68097
Berkholz, Christoph; Bonsma, Paul; Grohe, Martin
4
2013
Linear Diophantine equations, group CSPs, and graph isomorphism. Zbl 1410.68153
Berkholz, Christoph; Grohe, Martin
2
2017
Limitations of algebraic approaches to graph isomorphism testing. Zbl 1410.68152
Berkholz, Christoph; Grohe, Martin
2
2015
On the speed of constraint propagation and the time complexity of arc consistency testing. Zbl 1378.68058
Berkholz, Christoph; Verbitsky, Oleg
2
2013
Answering FO+MOD queries under updates on bounded degree databases. Zbl 1402.68041
Berkholz, Christoph; Keppeler, Jens; Schweikardt, Nicole
1
2017
Tight lower and upper bounds for the complexity of canonical colour refinement. Zbl 1368.68219
Berkholz, Christoph; Bonsma, Paul; Grohe, Martin
1
2017
Supercritical space-width trade-offs for resolution. Zbl 1387.03065
Berkholz, Christoph; Nordström, Jakob
1
2016
Bounds for the quantifier depth in finite-variable logics: alternation hierarchy. Zbl 1354.03038
Berkholz, Christoph; Krebs, Andreas; Verbitsky, Oleg
1
2015
Bounds for the quantifier depth in finite-variable logics: alternation hierarchy. Zbl 1356.03077
Berkholz, Christoph; Krebs, Andreas; Verbitsky, Oleg
1
2013
Lower bounds for existential pebble games and \(k\)-consistency tests. Zbl 1297.68088
Berkholz, Christoph
1
2013
Lower bounds for existential pebble games and \(k\)-consistency tests. Zbl 1360.68490
Berkholz, Christoph
1
2012
Linear Diophantine equations, group CSPs, and graph isomorphism. Zbl 1410.68153
Berkholz, Christoph; Grohe, Martin
2
2017
Answering FO+MOD queries under updates on bounded degree databases. Zbl 1402.68041
Berkholz, Christoph; Keppeler, Jens; Schweikardt, Nicole
1
2017
Tight lower and upper bounds for the complexity of canonical colour refinement. Zbl 1368.68219
Berkholz, Christoph; Bonsma, Paul; Grohe, Martin
1
2017
Near-optimal lower bounds on quantifier depth and Weisfeiler-Leman refinement steps. Zbl 1394.03052
Berkholz, Christoph; Nordström, Jakob
4
2016
Supercritical space-width trade-offs for resolution. Zbl 1387.03065
Berkholz, Christoph; Nordström, Jakob
1
2016
Limitations of algebraic approaches to graph isomorphism testing. Zbl 1410.68152
Berkholz, Christoph; Grohe, Martin
2
2015
Bounds for the quantifier depth in finite-variable logics: alternation hierarchy. Zbl 1354.03038
Berkholz, Christoph; Krebs, Andreas; Verbitsky, Oleg
1
2015
Tight lower and upper bounds for the complexity of canonical colour refinement. Zbl 1362.68097
Berkholz, Christoph; Bonsma, Paul; Grohe, Martin
4
2013
On the speed of constraint propagation and the time complexity of arc consistency testing. Zbl 1378.68058
Berkholz, Christoph; Verbitsky, Oleg
2
2013
Bounds for the quantifier depth in finite-variable logics: alternation hierarchy. Zbl 1356.03077
Berkholz, Christoph; Krebs, Andreas; Verbitsky, Oleg
1
2013
Lower bounds for existential pebble games and \(k\)-consistency tests. Zbl 1297.68088
Berkholz, Christoph
1
2013
Lower bounds for existential pebble games and \(k\)-consistency tests. Zbl 1360.68490
Berkholz, Christoph
1
2012

Citations by Year