Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 9, 2009

A parallel algorithm of complexity O(log2n) for the set balancing problem

  • N. N. KUZYURIN
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1992.2.5.483
Published Online: 2009-10-09
Published in Print: 1992

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 2 Issue 5

Journal and Issue

Articles in the same Issue

On cardinality of the set of alternatives in discrete many-criterion problems
Estimates for the number of appearances of symbols on a segment of recurrent sequence over a finite field
A parallel algorithm of complexity O(log2n) for the set balancing problem
Inequalities for functionals generated by bipartite graphs
Combinatorial polynomials in the algebra of shift-commutative operators
On lower bounds of sums of characters over the finite fields
Integral limit theorems for lacunary distributions
On limit theorems for decomposable statistics and efficiency of the corresponding statistical tests
Hypercycles in a random hypergraph
Downloaded on 29.4.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1992.2.5.483/html
Scroll to top button