OPTIMAL ASSIGMENT OF COMPUTER STORAGE BY CHAIN DECOMPOSITION OF PARTIALLY ORDERED SETS

Abstract

To save storage, a program is usually written so that each variable assumes several values. As a result, a program is usually difficult to understand and prone to errors. For an important class of programs, it will be shown that they can be written with complete freedom in the naming of variables; leaving the task of minimizing storage requirements to the computer itself.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1966
Accession Number
AD0631839

Entities

People

  • Gary H. Reynolds
  • George Bernard Dantzig

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Biomedical

DTIC Thesaurus Topics

  • Abstracts
  • California
  • Classification
  • Computations
  • Computer Programming
  • Computers
  • Contractors
  • Contracts
  • Decomposition
  • Intervals
  • Language
  • Machine Languages
  • Mathematics
  • Operations Research
  • Security
  • United States
  • Universities

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Control Systems Engineering.
  • Systems Analysis and Design