scientific article; zbMATH DE number 1746684

zbMATH Open0986.68170MaRDI QIDQ4530863FDOQ4530863

Ogihara, Mitsunori, Juan Luis Esteban, Sergio Díaz

Publication date: 9 June 2002

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1953213
• scientific article; zbMATH DE number 1738648
• An efficient approach to solving random \(k\)-SAT problems
• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• scientific article; zbMATH DE number 2089972
• Automating the DNA Computer: Solving n-Variable 3-SAT Problems
• Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
• Solving the satisfiability problem by using randomized approach
• A surface-based DNA algorithm for solving the binary knapsack problem
• Artificial Intelligence and Soft Computing - ICAISC 2004

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (3)

• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• Title not available (Why is that?)
• Title not available (Why is that?)

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 Q4530863)