Udvidet returret til d. 31. januar 2025

Complexity Lower Bounds using Linear Algebra - Satya Lokam - Bog

Bag om 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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9781601982421
  • Indbinding:
  • Paperback
  • Sideantal:
  • 176
  • Udgivet:
  • 20. juli 2009
  • Størrelse:
  • 156x234x10 mm.
  • Vægt:
  • 257 g.
  • 8-11 hverdage.
  • 28. november 2024

Normalpris

  • BLACK NOVEMBER

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af 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.

Brugerbedømmelser af Complexity Lower Bounds using Linear Algebra



Find lignende bøger
Bogen Complexity Lower Bounds using Linear Algebra findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.