3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
We prove that unrestricted static output-feedback stabilization is NP-hard, already in the single-input multiple-output case. More precisely, we give a polynomial-time many-one reduction from the NP-complete Betweenness problem. Given an instance with $n$ elements and $m$ betweenness constraints, the reduction construc...
We introduce the \emph{second order Zarankiewicz number} $z_2(m,n)$ for irreducible doubly simple biquadratic forms with $|E_1|=z(m,n)$, together with the intermediate recursive-line and signed parameters $z_{RL}(m,n)$ and $z_{SL}(m,n)$. They satisfy the unconditional hierarchy \[ \operatorname{BSR}(m,n) \ge z_2(m,n) \...
For $n\ge6$, $m=\binom n2$, let the complete-graph incidence family on $K_n$ have the vertices of $K_n$ as columns, its edges as rows, and the incidence graph as one-edge graph. The universal cell bound of L\"ofberg and Qi gives $z_2(m,n)\le Z(n):=\lfloor n(n-1)(n+2)/4\rfloor$. We implement the nested one-factorization...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
