72 citations · 320 across the 78 of their papers we have counts for
4 papers · 1 filter
Essential Convexity and Complexity of Semi-Algebraic Constraints
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
Let Γbe a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where a…
New Ramsey Classes from Old
Manuel Bodirsky
Let C_1 and C_2 be strong amalgamation classes of finite structures, with disjoint finite signatures sigma and tau. Then C_1 wedge C_2 denotes the class of all finite (sigma cup ta…
Topological Birkhoff
Manuel Bodirsky, Michael Pinsker
One of the most fundamental mathematical contributions of Garrett Birkhoff is the HSP theorem, which implies that a finite algebra B satisfies all equations that hold in a finite a…
Complexity Classification in Infinite-Domain Constraint Satisfaction
Manuel Bodirsky
A constraint satisfaction problem (CSP) is a computational problem where the input consists of a finite set of variables and a finite set of constraints, and where the task is to d…