A simple proof for the upper bound of the computational complexity of three monomials in three variables (Q2320000)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof for the upper bound of the computational complexity of three monomials in three variables |
scientific article |
Statements
A simple proof for the upper bound of the computational complexity of three monomials in three variables (English)
0 references
21 August 2019
0 references
