Efficient algorithms for chemical threshold testing problems

Author： Bonis A.D. Gargano L. Vaccaro U.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 493-511

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

Random lattices, threshold phenomena and efficient reduction algorithms

By Akhavi A.

Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. : 359-385

Elsevier

Access to resources Recommend Favorite

Efficient MFS Algorithms for Problems in Thermoelasticity

By Karageorghis A.

Journal of Scientific Computing, Vol. 56, Iss. 1, 2013-07 ,pp. : 96-121

Springer Publishing Company

Access to resources Recommend Favorite

Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

By Nikolopoulos S.D.

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 48-67

Elsevier

Access to resources Recommend Favorite

Efficient MFS Algorithms for Inhomogeneous Polyharmonic Problems

By Karageorghis A.

Journal of Scientific Computing, Vol. 46, Iss. 3, 2011-03 ,pp. : 519-541

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Algorithms for Variants of Weighted Matching and Assignment Problems

By Banerjee Satyajit

Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. : 673-688

Springer Publishing Company

Access to resources Recommend Favorite