Faculty of Computer Science, Technion – Israel Institute of Technology, Haifa, Israel

_{P}(G;k) is a polynomial in k. We present recent results and open problems on the complexity of evaluating ?

_{P}(G;λ) for various properties P and (not only integer) values of λ.

This is joint work with A. Goodall, M. Hermann, T. Kotek and S. Noble which was initiated during last year’s program “Counting Complexity and Phase Transitions”. See also arXiv:1701.06639v1.