The complexity of computing, via threshold circuits, the and of fixed-dimension $k\times k$ matrices with integer or rational entries is studied. We call these two problems ${\mathrm{𝖨𝖬𝖯}}_{𝗄}$ and ${\mathrm{𝖬𝖯𝖮𝖶}}_{𝗄}$, respectively, for short. We prove that: (i) For $k\ge 2$, ${\mathrm{𝖨𝖬𝖯}}_{𝗄}$ does not belong to ${\mathrm{TC}}^0$, unless ${\mathrm{TC}}^0={\mathrm{NC}}^1$.newline (ii) For : ${\mathrm{𝖨𝖬𝖯}}_{\mathsf{2}}$ belongs to ${\mathrm{TC}}^0$ while, for $k\ge 3$, ${\mathrm{𝖨𝖬𝖯}}_{𝗄}$ does not belong to ${\mathrm{TC}}^0$, unless ${\mathrm{TC}}^0={\mathrm{NC}}^1$. (iii) For any , ${\mathrm{𝖬𝖯𝖮𝖶}}_{𝗄}$ belongs to ${\mathrm{TC}}^0$.

We consider a class of semilinear elliptic equations of the form 15.7cm -${\epsilon }^2\Delta u(x,y)+a\left(x\right)W^{\text{'}}\left(u(x,y)\right)=0,(x,y)\in {ℝ}^2$ where $\epsilon >0$, $a:ℝ\to ℝ$ is a periodic, positive function and $W:ℝ\to ℝ$ is modeled on the classical two well Ginzburg-Landau potential $W\left(s\right)={(s^2-1)}^2$. We look for solutions to ([see full textsee full text]) which verify the asymptotic conditions $u(x,y)\to \pm 1$ as $x\to \pm \infty$ uniformly with respect to $y\in ℝ$. We show variational methods that if is sufficiently small and is not constant, then ([see full textsee full text]) admits infinitely many of such solutions,...