ACM DL

Journal of the ACM (JACM)

Menu

Search Issue
enter search term and/or author name

Archive


Journal of the ACM (JACM), Volume 7 Issue 4, Oct. 1960

Computational Aids for Determining the Minimal Form of a Truth Function
Ronald Prather
Pages: 299-310
DOI: 10.1145/321043.321044
The literature concerned with methods for finding the minimal form of a truth function is, by now, quite extensive. This article extends this knowledge by introducing an algorithm whereby all calculations are performed on decimal numbers...

Connective Properties Preserved in Minimal State Machines
Seymour Ginsburg
Pages: 311-325
DOI: 10.1145/321043.321045

Integer Programming Formulation of Traveling Salesman Problems
C. E. Miller, A. W. Tucker, R. A. Zemlin
Pages: 326-329
DOI: 10.1145/321043.321046
It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems in integer programming, that is, linear programming problems in which some or all of the variables are required to...

Techniques for Enumerating Veblen-Wedderburn Systems
Erwin Kleinfeld
Pages: 330-337
DOI: 10.1145/321043.321047

On Pre-Conditioning of Matrices
E. E. Osborne
Pages: 338-345
DOI: 10.1145/321043.321048

Resultant Procedure and the Mechanization of the Graeffe Process
Erwin H. Bareiss
Pages: 346-386
DOI: 10.1145/321043.321049

A Note on a Method of Computing the Gamma Function
N. L. Gordon, A. H. Flasterstein
Pages: 387-388
DOI: 10.1145/321043.321050
Numerous formulas are available for the computation of the Gamma function [1, 2]. The purpose of this note is to indicate the value of a well-known method that is easily extended for higher accuracy requirements. Using the recursion...

Computer Time for Address Calculation Sorting
Ivan Flores
Pages: 389-409
DOI: 10.1145/321043.321051
For each item to be sorted by address calculation, a location in the file is determined by a linear formula. It is placed there if the location is empty. If there is an item at the specified location, a search is made to find the closest empty...