Publication Type:

Journal Article

Source:

Journal of Information and Computing Science, Volume 3, Issue 1, Lyon-Villeurbanne, p.69-72 (2008)

URL:

https://www.scopus.com/inward/record.uri?eid=2-s2.0-21644443885&partnerID=40&md5=46c5f851932aa14b8ab8e9517b9b9666

Keywords:

Approximation theory, Graph theory, Markov processes, Matrix algebra, Multiplicative factors, Multiprocessing systems, Nonlinear optimization problems, Nonnegative entries, Optimization, Parallel algorithms, Polynomials, Post receive messages

Abstract:

Permanent of a matrix is # p - complete problem shown by many authors. In this paper we present a parallel algorithm for evaluation of permanent of an n × n matrix with multi processors.

Notes:

cited By 0; Conference of AMSE International Conference on Modelling and Simulation, MS'2004 ; Conference Date: 5 July 2004 Through 7 July 2004; Conference Code:65121

Cite this Research Publication

Dr. Somasundaram K. and Raj, S. M. Ab, “Permanent: Evaluation by parallel algorithm”, Journal of Information and Computing Science, vol. 3, no. 1, pp. 69-72, 2008.

207
PROGRAMS
OFFERED
6
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS