Constructive universal algebra: An introduction (Q579289): Difference between revisions

The author surveys his approach to the question of complexity of algebraic operations. Having a partial universal algebra (A,\(\Omega)\) and a partial algebraic operation f of (A,\(\Omega)\), a lower bound for the complexity of an optimal expression of f by \(\Omega\)-operations is presented.