A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. <P>Two algorithms are studied
An algorithmic theory of numbers, graphs, and convexity
โ Scribed by Laszlo Lovasz
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1986
- Tongue
- English
- Leaves
- 100
- Series
- CBMS-NSF regional conference series in applied mathematics 50
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. <P>Two algorithms are studied
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. <P>Two algorithms are studied
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. <P>Two algorithms are studied
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful.Two algorithms are studied in det