Symmetry in Computational Complexity

od · 22. březen 2018 · 112 zhlédnutí ·

The rapid progress in computational-theoretic aspects of the fixed-language Constraint Satisfaction Problems during the last 20 years has been fueled by the connection between their computational complexity and a certain concept that captures the symmetry of Constraint Satisfaction Problems.

Sledujte SlidesLive na mobilních zařízeních

© SlidesLive s.r.o.