
Congestion and all 4 variants of GD-FixedPoint are \(\cap \) -complete.The completeness for the first variant of GD-FixedPoint was proved by [1]}. This is the first case of a naturalSee Footnote REF . complete problem for \(\cap \)  or any of its subclasses.

\(= \cap \) .


