๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On space-efficient algorithms for certain NP-complete problems

โœ Scribed by A. Ferreira

Book ID
107948769
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
299 KB
Volume
120
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

DNA Models and Algorithms for NP-Complet
DNA Models and Algorithms for NP-Complete Problems
โœ Eric Bach; Anne Condon; Elton Glaser; Celena Tanguay ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 488 KB

A goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-coloring, which can only be run on small instances and, hence, are not practical. In this pape

On the np-completeness of certain networ
On the np-completeness of certain network testing problems
โœ S. Even; O. Goldreich; S. Moran; P. Tong ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 946 KB

Let G ( V , E) be an undirected graph which describes the structure of a communication network. During the maintenance period every line must be tested in each of the two possible directions. A line is tested by assigning one of its endpoints t o be a transmitter, the other to be a receiver, and sen

New evolutionary genetic algorithms for
New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
โœ Fam Quang Bac; V. L. Perov ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 424 KB

Evolutionary genetic algorithms have been proposed to solve NP-complete combinatorial optimization problems. A new crossover operator based on group theory has been created. Computational processes motivated by proposed evolutionary genetic algorithms were described as stochastic processes, using po