Complexity of Makanin's algorithm (Q4371685): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q128392129, #quickstatements; #temporary_batch_1730844495191 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054924158 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128392129 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:08, 5 November 2024
scientific article; zbMATH DE number 1106119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Makanin's algorithm |
scientific article; zbMATH DE number 1106119 |
Statements
Complexity of Makanin's algorithm (English)
0 references
22 January 1998
0 references
diophantine equation
0 references
periodicity
0 references
nonnumerical algorithms
0 references
word-unification algorithms
0 references
