A simple proof for the upper bound of the computational complexity of three monomials in three variables (Q2320000): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3103/s0027132219020013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2944466192 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 30 July 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
