Backbone

We seek to explicit, and then exploit, potential structural properties of algebraic systems in order to solve them efficiently.

Very often, large systems describing real problems are well structured in the sense that the impact of a slight change of one variable is relatively local and do not propagate through out the entire system.

We aim to capture automatically such locality and use it appropriately to decompose the original task into a sequence of smaller problems to solve.

The challenge is then to find a good sequence that is guaranteed to have a better complexity bound than a generic handling of the problem.