Combinatorics, computing and complexity
Author(s)
Bibliographic Information
Combinatorics, computing and complexity
（Mathematics and its applications, . Chinese series）
Science Press , Kluwer Academic Publishers, c1989
- : us
- : cc
Available at / 33 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C-P||Tianjin and Beijing||1988.889068609
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
DC19:511.6/D852070134456
-
No Libraries matched.
- Remove all filters.
Note
Papers presented at an international conference held Aug. 14-26, 1988, in Tientsin, China, and Peking, China
Description and Table of Contents
Description
One service mathematics has rendered the 'Et moi, ..., si j'avait su comment en revenir, It has put common sense back je n'y serais point al!e.' human race. Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded n- sense'. The series is divergent; therefore we may be able to do something with it. Eric T. Bell o. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and non- linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics ...'; 'One service logic has rendered com- puterscience ...'; 'One service category theory has rendered mathematics ...'. All arguably true. And all statements obtainable this way form part of the raison d'etre of this series.
Table of Contents
What is structural complexity theory?.- Constructing oracles by lower bound techniques for circuits.- Randomness, tally sets, and complexity classes.- On one-way functions.- A new lower bound for parity circuits.- How to design round Robin schedules.- Bandwidth in multigrids for random graphs.- A flavor of matroids, graphs and optimal job assignment problems in operations research.- Algorithms for polymatroid optimization.- Free partially commutative groups.- Some results on VLSI parallel algorithms.- On optimal arrangement of 12 points.- Some discussions on vehicle routing problems.
by "Nielsen BookData"
