The following pages link to Christoph Berkholz (Q2398206):
Displaying 21 items.
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306) (← links)
- On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing (Q2849906) (← links)
- Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761) (← links)
- (Q2958513) (← links)
- Parameterized Complexity of Fixed Variable Logics (Q2978506) (← links)
- (Q3174897) (← links)
- (Q3304105) (← links)
- (Q3305351) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- Linear Diophantine Equations, Group CSPs, and Graph Isomorphism (Q4575758) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q4598196) (← links)
- Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler--Leman Refinement Steps (Q4635882) (← links)
- Answering FO+MOD Queries under Updates on Bounded Degree Databases (Q5012590) (← links)
- (Q5092420) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q5215515) (← links)
- Lower Bounds for Existential Pebble Games and k-Consistency Tests (Q5891234) (← links)
- Lower Bounds for Existential Pebble Games and k-Consistency Tests (Q5892434) (← links)
- A dichotomy for succinct representations of homomorphisms (Q6638121) (← links)
- Boolean basis, formula size, and number of modal operators (Q6741248) (← links)
