Combinatorics, Computing and Complexity

252 Seiten, Hardcover

Kurzbeschreibung des Verlags

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.

• Themen: Mathematik und Naturwissenschaften Mathematik Mathematische Analysis, allgemein Numerische Mathematik
• ISBN: 9780792303084
• Sprache: Englisch
• Erscheinungsdatum: 30.09.1989
• Größe: 241 x 160 mm
• Verlag: Springer
• Herausgegeben von: Xiao-Xin Du, Hu Guoding