3R1545 Solution of NP-complete Problems on Hybrid DNA Computer

Seibutsu Butsuri
doi 10.2142/biophys.42.s210_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Biophysical Society of Japan

Related search

On the Classification of NP Complete Problems and Their Duality Feature

International Journal of Computer Science and Information Technology
2018English

Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1982English

DNA Solution of Hard Computational Problems

Science
MultidisciplinaryPhilosophy of ScienceHistory
1995English

Computer Methods for Solution of Duct‐Noise Problems

Journal of the Acoustical Society of America
AcousticsUltrasonicsArtsHumanities
1962English

Theory-Contraction Is NP-Complete

Logic Journal of the IGPL
Philosophy
2003English

An NP-complete Matching Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1980English

Reoptimization of NP-Hard Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Elastic Image Matching Is NP-complete

Pattern Recognition Letters
Signal ProcessingComputer VisionPattern RecognitionArtificial IntelligenceSoftware
2003English

Graph Decomposition Is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing
MathematicsComputer Science
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy