Discrete Algorithms
This proceedings is designed for computer scientists, engineers and mathematicians interested in the use, design and analysis of algorithms, with special emphasis on questions of efficiency.
- ISBN 13 : 9780898712711
- ISBN 10 : 0898712718
- Judul : Discrete Algorithms
- Pengarang : Annual ACM-SIAM Symposium Discrete Algorithms,
- Penerbit : SIAM
- Bahasa : en
- Tahun : 1991
- Halaman : 482
- Halaman : 482
- Google Book : http://books.google.co.id/books?id=fuB8dMhKBzsC&dq=inauthor:Discrete+Mathematics+with+Combainatoric&hl=&source=gbs_api
-
Ketersediaan :
[3] P. J. CARSTENSEN, The complexity of some problems in parametric, linear,
and combinatorial programming, PhD thesis, Department of Mathematics,
University of Michigan, Ann Arbor, Mich., 1983. [4] E. COHEN AND N. MEGIDDO,
...