“…The complexity of such algorithms is usually determined by geometric invariants associated to the family of systems under consideration (see, e.g., [16], [25], [53], [44], [24], [27], [13], [50], [31], [39]), typically in the form of a suitable (arithmetic or geometric) Bézout number (see [36], [25], [33], [46], [26], [23], [43]). …”