Using randomization to make recursive matrix algorithms practical (Q4948004): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0956796899003470 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970421476 / rank | |||
Normal rank | |||
Latest revision as of 08:43, 30 July 2024
scientific article; zbMATH DE number 1435950
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using randomization to make recursive matrix algorithms practical |
scientific article; zbMATH DE number 1435950 |
Statements
Using randomization to make recursive matrix algorithms practical (English)
0 references
26 April 2000
0 references
recursive block decomposition algorithms
0 references
quadtree algorithms
0 references
