DNA Solution of Hard Computational Problems

Science - United States
doi 10.1126/science.7725098
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Association for the Advancement of Science (AAAS)

Related search

Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

PLoS ONE
Multidisciplinary
2013English

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

Seibutsu Butsuri
2002English

Hard (State) Problems

2009English

Reoptimization of NP-Hard Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Computational Discovery of Hard and Superhard Materials

Journal of Applied Physics
AstronomyPhysics
2019English

Generating Highly Balanced Sudoku Problems as Hard Problems

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2010English

Computational Topology for Configuration Spaces of Hard Disks

2011English

Some Hard Families of Parameterized Counting Problems

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2015English

Conformal Solution Theory: Hard-Sphere Mixtures

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1971English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy