Over 10 mio. titler Fri fragt ved køb over 499,- Hurtig levering Forlænget returret til 31/01/25

Complexity Lower Bounds Using Linear Algebra

Bog
  • Format
  • Bog, paperback
  • Engelsk
  • 168 sider

Beskrivelse

While rapid progress has been made on upper bounds (algorithms), progress on lower bounds on the complexity of explicit problems has remained slow despite intense efforts over several decades. As is natural with typical impossibility results, lower bound questions are hard mathematical problems and hence are unlikely to be resolved by ad hoc attacks. Instead, techniques based on mathematical notions that capture computational complexity are necessary. Complexity Lower Bounds using Linear Algebra surveys several techniques for proving lower bounds in Boolean, algebraic, and communication complexity based on certain linear algebraic approaches. The common theme among these approaches is to study robustness measures of matrix rank that capture the complexity in a given model. Suitably strong lower bounds on such robustness functions of explicit matrices lead to important consequences in the corresponding circuit or communication models. Understanding the inherent computational complexity of problems is of fundamental importance in mathematics and theoretical computer science. Complexity Lower Bounds using Linear Algebra is an invaluable reference for anyone working in the field.

Læs hele beskrivelsen
Detaljer
  • SprogEngelsk
  • Sidetal168
  • Udgivelsesdato20-07-2009
  • ISBN139781601982421
  • Forlag Now Publishers
  • Nummer i serien12
  • FormatPaperback
  • Udgave0
Størrelse og vægt
  • Vægt253 g
  • Dybde0,9 cm
  • coffee cup img
    10 cm
    book img
    15,5 cm
    23,3 cm

    Findes i disse kategorier...

    Se andre, der handler om...

    Machine Name: SAXO084