Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms

Author： Hagiya M.   Rose J.A.   Komiya K.   Sakamoto K.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.287, Iss.1, 2002-09, pp. : 59-71

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Complexity Analysis of Vedic Mathematics Algorithms for Multicore Environment

By  

International Journal of Rough Sets and Data Analysis (IJRSDA), Vol. 4, Iss. 4, 2017-10 ,pp. : 31-47

IGI Global_journal

Access to resources Recommend Favorite

Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations: Algorithms for Computing Statistics under Interval Uncertainty, and Their Computational Complexity

By Kreinovich Vladik   Xiang Gang   Starks Scott   Longpré Luc   Ceberio Martine   Araiza Roberto   Beck Jan   Kandathi Raj   Nayak Asis   Torres Roberto   Hajagos Janos  

Reliable Computing, Vol. 12, Iss. 6, 2006-12 ,pp. : 471-501

Springer Publishing Company

Access to resources Recommend Favorite

Complexity and algorithms for nonlinear optimization problems

By Hochbaum Dorit  

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 257-296

Springer Publishing Company

Access to resources Recommend Favorite

Linear analysis of genetic algorithms

By Schmitt L.M.   Nehaniv C.L.   Fujii R.H.  

Theoretical Computer Science, Vol. 200, Iss. 1, 1998-06 ,pp. : 101-134

Elsevier

Access to resources Recommend Favorite

Fourier Analysis of Genetic Algorithms

By Kosters W.A.   Kok J.N.   Floreen P.  

Theoretical Computer Science, Vol. 229, Iss. 1, 1999-11 ,pp. : 143-175

Elsevier

Access to resources Recommend Favorite