The study of the complexity constraint satisfaction problem (CSP), centred around Feder-Vardi Dichotomy Conjecture, has been very prominent in last two decades. After a long concerted effort and many partial results, Conjecture proved 2017 independently by Bulatov Zhuk. At about same time, vast generalisation CSP, called promise started to gain prominence. In this survey, we explain importance ...

The subject of Polynomiography deals with algorithmic visualization of polynomial equations, having many applications in STEM and art, see [8]-[12]. Here we consider the polynomiography of the partial sums of the exponential series. While the exponential function is taught in standard calculus courses, it is unlikely that properties of zeros of its partial sums are considered in such courses, l...

Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper presents the history, basic ideas and recent development in quantum game theory. In this context, a new application of the Ising chain model is proposed.