Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

A method for finding permanents of $0, 1$ matrices
HTML articles powered by AMS MathViewer

by Ralph Kallman PDF
Math. Comp. 38 (1982), 167-170 Request permission

Abstract:

Certain row operations are used in a method for computing permanents of 0, 1 matrices. Machine execution times for this method are compared with those for the Ryser and Nijenhuis-Wilf algorithms.
References
    R. Kallman, Computer Programs for Evaluating Permanents of 0, 1 Matrices, Dept. of Math. Techn. Report., Ball State Univ., 1980.
  • Albert Nijenhuis and Herbert S. Wilf, Combinatorial algorithms, 2nd ed., Computer Science and Applied Mathematics, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], New York-London, 1978. For computers and calculators. MR 510047
  • Herbert John Ryser, Combinatorial mathematics, The Carus Mathematical Monographs, No. 14, Mathematical Association of America; distributed by John Wiley and Sons, Inc., New York, 1963. MR 0150048, DOI 10.5948/UPO9781614440147
Similar Articles
Additional Information
  • © Copyright 1982 American Mathematical Society
  • Journal: Math. Comp. 38 (1982), 167-170
  • MSC: Primary 15A15; Secondary 05B20, 15-04
  • DOI: https://doi.org/10.1090/S0025-5718-1982-0637294-0
  • MathSciNet review: 637294