Combinatorics, Computing and Complexity / Edition 1

Combinatorics, Computing and Complexity / Edition 1

by Xiao-Xin Du, Hu Guoding
ISBN-10:
0792303083
ISBN-13:
9780792303084
Pub. Date:
09/30/1989
Publisher:
Springer Netherlands
ISBN-10:
0792303083
ISBN-13:
9780792303084
Pub. Date:
09/30/1989
Publisher:
Springer Netherlands
Combinatorics, Computing and Complexity / Edition 1

Combinatorics, Computing and Complexity / Edition 1

by Xiao-Xin Du, Hu Guoding

Hardcover

$54.99 Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

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.

Product Details

ISBN-13: 9780792303084
Publisher: Springer Netherlands
Publication date: 09/30/1989
Series: Mathematics and its Applications , #1
Edition description: 1989
Pages: 240
Product dimensions: 6.14(w) x 9.21(h) x 0.24(d)

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.
From the B&N Reads Blog

Customer Reviews