Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient parallel algorithms to test square-freeness and factorize strings |
scientific article; zbMATH DE number 23318
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parallel algorithms to test square-freeness and factorize strings |
scientific article; zbMATH DE number 23318 |
Statements
Efficient parallel algorithms to test square-freeness and factorize strings (English)
0 references
26 June 1992
0 references
CRCW PRAM
0 references
0.9067319
0 references
0.8969785
0 references
0.8852841
0 references
0.8836093
0 references
0.8757254
0 references
0.8750618
0 references
