ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Algorithm 269: determinant evaluation [F3]
Full text PdfPdf (327 KB)
Source
Communications of the ACM archive
Volume 8 ,  Issue 11  (November 1965) table of contents
Page: 668  
Year of Publication: 1965
ISSN:0001-0782
Authors
Jaroslav Pfann  Institute of Nuclear Research, Řež by Prague, Czechoslovakia
Josef Straka  Institute of Nuclear Research, Řež by Prague, Czechoslovakia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 13,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/365660.365675
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
William Marshall McKeeman, Algorithm 135: Crout with equilibration and iteration, Communications of the ACM, v.5 n.11, p.553-555, Nov. 1962  [doi>10.1145/368996.369009]
 
1
HOARE, C. A.R. Algorithms 03 and 64. Comm. ACM 4 (July 1961), 321.
2
Thomas N. Hibbard, Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting, Journal of the ACM (JACM), v.9 n.1, p.13-28, Jan. 1962  [doi>10.1145/321105.321108]
3
Thomas N. Hibbard, An empirical study of minimal storage sorting, Communications of the ACM, v.6 n.5, p.206-213, May 1963  [doi>10.1145/366552.366557]

CITED BY  2
Lyle B. Smith, Interval arithmetic determinant evaluation and its use in testing for a Chebyshev system, Communications of the ACM, v.12 n.2, p.89-93, Feb. 1969
S. Y. Ku , R. J. Adler, Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm, Communications of the ACM, v.12 n.1, p.23-30, Jan. 1969

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Algorithms, Design, Performance, Theory

Collaborative Colleagues:
Jaroslav Pfann: colleagues
Josef Straka: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player