A simple proof for the upper bound of the computational complexity of three monomials in three variables (Q2320000): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1675531 |
||
| Property / author | |||
| Property / author: Vadim V. Kochergin / rank | |||
Revision as of 04:53, 29 February 2024
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
