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

New quantum algorithm for studying NP-complete problems

โœ Scribed by Ohya, Masanori; Volovich, Igor V.

Book ID
121190657
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
524 KB
Volume
52
Category
Article
ISSN
0034-4877

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

NP Problem in Quantum Algorithm
NP Problem in Quantum Algorithm
โœ Masanori Ohya; Natsuki Masuda ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› World Scientific Publishing Company ๐ŸŒ English โš– 173 KB
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