Elsevier

Parallel Computing

Volume 16, Issues 2–3, December 1990, Pages 343-350
Parallel Computing

Practical aspect and experience
The vectorization of the partition problem

https://doi.org/10.1016/0167-8191(90)90071-GGet rights and content

Abstract

This paper describes a vectorized algorithm for the partition problem, a famous NP-complete problem. A set of partition problems that required 518 seconds to be solved on a VAX/8550 computer would require only 2 seconds on the Cyber 205 under the vector mode. A partition problem with n equal to 1000 was solved in only 6.34 seconds.

References (15)

  • W Rönsch et al.

    Timing results of some internal sorting algorithms on vector computers

    Parallel Comput.

    (1987)
  • S.J Shyu et al.

    Solving the set cover problem on a supercomputer

    Parallel Comput.

    (1990)
  • D.E Denning

    Cryptography and Data Security

    (1982)
  • Y.G Desmedt et al.

    A critical analysis of the security of knapsack public-key algorithms

    IEEE Trans. Inform. Theory

    (July 1984)
  • M.R Garey et al.

    Computers and Intractability — A Guild to the Theory of NP-completeness

    (1979)
  • R.W Hockney et al.

    Parallel Computers: Architecture, Programming and Algorithms

    (1981)
  • K Hwang et al.

    Computer Architectures and Parallel Processing

    (1984)
There are more references available in the full text version of this article.

Cited by (2)

View full text