A parallel algorithm of complexity O(log 2 n) for the set balancing problem

DOI10.1515/DMA.1992.2.5.483zbMATH Open0787.90076OpenAlexW2079145104MaRDI QIDQ3987234

N. N. Kuzyurin

Publication date: 28 June 1992

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1992.2.5.483

zbMATH Keywords

upper bound of the running times

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Parallel numerical computation (65Y05) Distributed algorithms (68W15)

Related Items (1)

Title not available (Why is that?)

This page was built for publication: A parallel algorithm of complexity O(log 2 n) for the set balancing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987234)