Combinatorics, Computing and Complexity
Editat de Xiao-Xin Du, Hu Guodingen Limba Engleză Hardback – 30 sep 1989
Preț: 376.57 lei
Puncte Express: 565
Carte tipărită la comandă
Livrare economică 20 mai-03 iunie
Specificații
ISBN-13: 9780792303084
ISBN-10: 0792303083
Pagini: 252
Ilustrații: X, 240 p.
Dimensiuni: 160 x 241 x 19 mm
Greutate: 0.55 kg
Ediția:1989
Editura: Springer
Locul publicării:Dordrecht, Netherlands
ISBN-10: 0792303083
Pagini: 252
Ilustrații: X, 240 p.
Dimensiuni: 160 x 241 x 19 mm
Greutate: 0.55 kg
Ediția:1989
Editura: Springer
Locul publicării:Dordrecht, Netherlands
V-ar putea interesa
-
Graphs, Colourings and the Four-Colour TheoremRobert A. Wilson-20%Preț: 450.87 lei560.13 lei -
Combinatorics, Complexity, and Chance: A Tribute to Dominic WelshGeoffrey Grimmett-34%Preț: 707.46 lei1077.34 lei -
Combinatorics: Ancient & ModernRobin Wilson-33%Preț: 774.46 lei1161.83 lei -
Introduction to Graph TheoryRobin J. WilsonPreț: 381.70 lei -
Modern Graph TheoryBela BollobásPreț: 442.77 lei -
Random GraphsSvante Janson-9%Preț: 1046.04 lei1149.49 lei -
CombinatoricsRussell Merris-9%Preț: 1105.69 lei1215.05 lei -
Graph TheoryRussell Merris-9%Preț: 1139.57 lei1252.28 lei -
Combinatorial Algorithms: Generation, Enumeration, and SearchDonald L. Kreher-18%Preț: 1024.62 lei1249.54 lei -
Preț: 328.33 lei -
Preț: 266.89 lei -
Elliptic Curves: Number Theory and Cryptography, Second EditionLawrence C. Washington-18%Preț: 1419.63 lei1731.26 lei -
Principia Mathematica - Volume ThreeAlfred North WhiteheadPreț: 191.21 lei
Public țintă
ResearchCuprins
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.