Archive
Software Projects
The ALPHA Project
Storage packing problem
Working notes, 15.06.1961
entitled "First version of a coherent account of the lower bound" made during the work on the paper "On the chromatic number estimate for connected graphs"
Working notes, 16.06.1961
entitled "Derivation of more bounds" made during the work on the paper "On the chromatic number estimate for connected graphs"
Working notes, 19.06.1961
entitled "Bounds estimation. Diagram and approximate calculations resulting in the coefficient ~1.2" made during the work on the paper "On the chromatic number estimate for connected graphs"
Working notes, 20.06.1961
"More accurate calculation of the bound estimation resulting in the coefficient 1.125 (together with Gena and Yulik)"
Working notes, 20.06.1961
entitled "False attempt to find the estimate in a more elementary way. Got back to where I started"
Working notes, 25.06.1961
entitled "Obtaining an explicit formula for the lower bound"
Working notes, 26.06.1961
entitled "Proof of the lower bound attainability"
Cover
with inscription "Storage packing problem.¹8. Implementation of the algorithms in ALPHA-compiler. Started:3.2.63, Finished: 28.1.64"
Working notes, 19.09.1960-12.10.1960
entitled "Storage packing problem (second definition). Problem statement and necessary criteria"
Cover
inscribed:"First draft of the DAN paper. August 12-20, 1961"
Working notes
containing series expansion of many functions

1 2
Initial order | In alphabetical order | By date

Switch to Russian | Search | Advanced search | Folders | Themes
Home Help in Russian Webmaster © Ershov's Institute of Informatics Systems, 2000-2016