An Algorithmic Theory of Numbers, Graphs and Convexity || Introduction
✍ Scribed by Lovász, László
- Book ID
- 118169408
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1986
- Weight
- 399 KB
- Volume
- 10.1137/1.9781611970203
- Category
- Article
- ISBN
- 1611970202
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
he goal of this paper is to provide a simple introduction to Algorithmic Information Theory (AIT) that will highlight some of the main ideas without presenting too many details. More technical treatments of these ideas can be found in References [1], [2], [3] and [4], which are listed at the end of
The theory of random graphs has been mainly concerned with structural w x properties, in particular the most likely values of various graph invariantsᎏsee Bollobas 21 . There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this pap