Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently ...

A UNSW Sydney mathematician has discovered a new method to tackle algebra's oldest challenge—solving higher polynomial equations. Polynomials are equations involving a variable raised to powers, such ...

In this paper, we establish hardness and approximation results for various Lp-ball constrained homogeneous polynomial optimization problems, where p ∈ [2, ∞]. Specifically, we prove that for any given ...

Two mathematicians have used a new geometric approach in order to address a very old problem in algebra. In school, we often learn how to multiply out and factor polynomial equations like (x² – 1) or ...

We prove that if $f(x)=\sum _{k=0}^{n-1}a_{k}x^{k}$ is a polynomial with no cyclotomic factors whose coefficients satisfy $a_{k}$ ≡ 1 mod 2 for 0 ≤ k < n, then ...

A UNSW Sydney mathematician has discovered a new method to tackle algebra’s oldest challenge – solving higher polynomial equations. Polynomials are equations involving a variable raised to powers, ...

Two mathematicians have used a new geometric approach in order to address a very old problem in algebra. In school, we often learn how to multiply out and factor polynomial equations like (x² – 1) or ...