M. S. Burgin, “Complexity of parallel algorithms and computations”, Dokl. Akad. Nauk SSSR, 1982, Volume 265, Number 2,Pages <nobr>268

JOURNALS // Doklady Akademii Nauk // Archive

Dokl. Akad. Nauk SSSR, 1982 Volume 265, Number 2, Pages 268–274 (Mi dan45427)

MATHEMATICS

Complexity of parallel algorithms and computations

M. S. Burgin

State Institute design of agricultural machinery plants, Kiev

UDC: 51.01:518.5

Presented: A. N. Kolmogorov
Received: 09.03.1982

Fulltext: PDF file (993 kB)

Bibliographic databases: