Search
Now showing items 1-10 of 17
An Enciphering Module for Multics
(1974-07)
Recently IBM Corporation has declassified an algorithm for encryption usable for computer-to-computer or computer-to-terminal communications. Their algorithm was implemented in a hardware device called Lucifer. A software ...
An Investigation of Current Language Support for the Data Requirements of Structured Programming
(1974-09)
Structured programming is a new method for constructing reliable programs. Structured programming relies upon a systematic technique of top-down development which involves the refinement of both control structures and data ...
Research on Experts Systems
(1974-12)
On the Complexity of the Theories of Weak Direct Products
(1974-01)
Let N be the set of nonnegative integers and let < N ,+> be the weak direct product of < N,+> with itself. Mostowski[ 9 ] shows that the theory of < N ,*> is decidable, but his decision procedure isn't elementary recursive. ...
Super-exponential Complexity of Presburger Arithmetic
(1974-02)
Lower bounds are established on the computational complexity of the decision problem and on the inherent lengths of proofs for two classical decidable theories of logic: the first order theory of the real numbers under ...
Symmetry Codes and Their Invariant Subcodes
(1974-02)
We define and study the invariant subcodes of the symmetry codes in order to be able to determine the algebraic properties of these codes. An infinite family of self-orthogonal rate 1/2 codes over GF (3), called symmetry ...
Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on Number of Multiplications
(1974-06)
In this paper we describe a new method for establishing lower bounds for the number of multiplications and divisions required to compute rational functions. We shall start by reminding the reader of some standard notations.
Complete Classification of (24,12) and (22,11) Self-dual Codes
(1974-06)
A complete classification is given of all [22, 11] and [24, 12] self-dual codes. For each code we give the order of its group, the number of codes equivalent to it, and its weight distribution. There is a unique [24, 12, ...
Discrete Computation: Theory and Open Problems
(1974-01)
Complexity 1. Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. Aho, ed., Prentice-Hall, Englewood Cliff, N.J., 1973,pp.32-89.