《Combinatorics, Computing and Complexity》是1989年科學出版社出版的圖書，作者是Du Dingzhu, Hu Guoding。
基本介紹
- 中文名：Combinatorics, Computing and Complexity
- 作者：Du Dingzhu, Hu Guoding
- 出版社：科學出版社
- 出版時間：1989年1月
- ISBN：7030014383
內容簡介,圖書目錄,
內容簡介
This volume contains a selection of the review papers presented at the International Symposium on Combinatorial Optimization held during August 1988 in Tianjin and Beijing,China.The subjects covered embrace structural complexity theory as well as various aspects of combinatorics and computing.This collection of papers provide a useful state-of-art review of activity in these fields both in the West and in China.
圖書目錄
Table of Contents
What is structural complexity theory? R.V.Book
Constructing oracles by lower bound techniques for circuits Ker-I Ko
Randomness,tally sets,and complexity classes Tang Shouwen
On one-way functions O.Watanabe
A new lower bound for parity circuits Du Dingzhu
How to design round Robin schedules F.K.Hwang
Bandwidth in multigrids for random graphs Z.Miller
A flavor of matroids,graphs and optimal job assignment problems in operations research J.M.S.Sim#es-Pereira
Algorithms for polymatroid optimization Wang Zhemin
Free partially commutative groups C.Wrathall
Some results on VLSl parallel algorithms Xu Meirui,Zhao Dongyue and Liu Xiaolin
On optimal arrangement of 12 points Yao Tianxing
Some discussions on vehicle routing problems Yu Wenci
