Skip to main content
Article
Licensed
Unlicensed Requires Authentication

The Newton sums method in combinatorial optimization

Published/Copyright: October 8, 2009
Become an author with De Gruyter Brill
Author Information Explore this Subject
Discrete Mathematics and Applications
From the journal Volume 1 Issue 4

Published Online: 2009-10-08
Published in Print: 1991

Walter de Gruyter

Articles in the same Issue

  1. The Newton sums method in combinatorial optimization
  2. Kerdock code in a cyclic form
  3. On the conditions of regularity for finite autonomous automata
  4. On lower bounds for the time of computation
  5. Stochasticity of the languages acceptable by two-way finite probabilistic automata
  6. On completeness of the binary boundedly determined functions with respect to superposition
  7. Weighings, allocations, and the embeddability of partitions
  8. On the circle method
  9. Distribution of the permanent of a random Boolean matrix
https://doi.org/10.1515/dma.1991.1.4.349

Articles in the same Issue

  1. The Newton sums method in combinatorial optimization
  2. Kerdock code in a cyclic form
  3. On the conditions of regularity for finite autonomous automata
  4. On lower bounds for the time of computation
  5. Stochasticity of the languages acceptable by two-way finite probabilistic automata
  6. On completeness of the binary boundedly determined functions with respect to superposition
  7. Weighings, allocations, and the embeddability of partitions
  8. On the circle method
  9. Distribution of the permanent of a random Boolean matrix
Downloaded on 7.5.2026 from https://www.degruyterbrill.com/document/doi/10.1515/dma.1991.1.4.349/html?lang=en
Scroll to top button