cles in this issue, is based on an extension of the language of logic programming under the answer set semantics. In ASP, an instance of a computational problem is encoded by an answer set program in such a way that the Herbrand models of the program determine all solutions for the problem instance. Thus, at an abstract level, answer set programs are specifications of finite Herbrand structures...

Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and membership for quantum correlations. Most of these results rely on reductions from a handful undecidable problems, such as halting problem, tiling Post correspondence or matrix mortality problem. All common property: they an NP-hard bounded version. This work establishes relation between...

Let $G$ be a nonabelian, simple group with nontrivial conjugacy class $C \subseteq G$. $K$ diagram of an oriented knot in $S^3$, thought as computational input. We show that for each such and $C$, the problem counting homomorphisms $\pi_1(S^3\setminus K) \to G$ send meridians to $C$ is almost parsimoniously $\mathsf{\#P}$-complete. This work sequel previous result by authors from fundamental gr...

Background and Aims: The novel approaches in influenza vaccination have targeted more conserved viral proteins such as nucleoprotein (NP) to provide cross protection against all serotypes of influenza A viruses. Influenza specific cytotoxic T lymphocytes (CTL) are able to lyse influenza-infected cells by recognition of NP, the major target molecule in virus for CTL responses. On the other hand,...