On the Bit Complexity of Solving Bilinear Polynomial Systems (Q2985830): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57908658, #quickstatements; #temporary_batch_1711504539957 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2503997773 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57908658 / rank | |||
Normal rank | |||
Latest revision as of 04:45, 27 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Bit Complexity of Solving Bilinear Polynomial Systems |
scientific article |
Statements
On the Bit Complexity of Solving Bilinear Polynomial Systems (English)
0 references
10 May 2017
0 references
DMM
0 references
bilinear polynomial
0 references
polynomial system solving
0 references
resultant matrix
0 references
separation bounds
0 references
