scientific article; zbMATH DE number 1735643

MaRDI QIDQ4329029zbMATH OpenFDO

Authors Vincenzo Manca

Publication date 29 April 2002

zbMATH Keywords

DNA algorithmsproblem-solving agentspropositional satisfiability

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 2087017
• Membrane Computing
• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• Theoretical Computer Science
• scientific article; zbMATH DE number 1958491

Cited in

(9)

• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• Metabolic computing
• Autonomous resolution based on DNA strand displacement
• scientific article; zbMATH DE number 1735644 (Why is no real title available?)
• scientific article; zbMATH DE number 2087017 (Why is no real title available?)
• Theoretical Computer Science
• Membrane Computing
• Aspects of Molecular Computing
• Sublinear P system solutions to NP-complete problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4329029)