Combinatorics, Computing and Complexity

Author:   Xiao-Xin Du ,  Hu Guoding
Publisher:   Springer
Edition:   1989 ed.
Volume:   1
ISBN:  

9780792303084


Pages:   240
Publication Date:   30 September 1989
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $551.76 Quantity:  
Add to Cart

Share |

Combinatorics, Computing and Complexity


Add your own review!

Overview

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.

Full Product Details

Author:   Xiao-Xin Du ,  Hu Guoding
Publisher:   Springer
Imprint:   Springer
Edition:   1989 ed.
Volume:   1
Dimensions:   Width: 15.60cm , Height: 1.50cm , Length: 23.40cm
Weight:   1.180kg
ISBN:  

9780792303084


ISBN 10:   0792303083
Pages:   240
Publication Date:   30 September 1989
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List