Applications of parallel processors to some hard discrete problems

DOI10.1016/0096-3003(86)90117-7MaRDI QIDQ1089807zbMATH OpenOpenAlexFDO

Authors Michael J. Gilpin, Robert O. Shelton

Publication date 1986

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(86)90117-7

zbMATH Keywords

complexitydiscrete mathematicsparallel processors

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Review text

A part of investigation of problems in discrete mathematics involves using the computer. Such problems may or may not be exponential in complexity. This paper investigates the effect of complexity in such investigations and points out that such investigations are in essence an experimental science.

Recommendations

• Parallel computations on graphs
• Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems
• Optimization parallelizing for discrete programming problems
• Publication:4729359
• scientific article; zbMATH DE number 3889284

Cites work

• Aperiodic words on three symbols. II.
• Forced Differences Between Terms of Subsequences of Integer Sequences
• scientific article; zbMATH DE number 3732062 (Why is no real title available?)
• Three Identities between Stirling Numbers and the Stabilizing Character Sequence

This page was built for publication: Applications of parallel processors to some hard discrete problems

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