Lower Bounds in Communication Complexity
โ Troy Lee, Adi Shraibman
๐ Library
๐
2009
๐ Now Publishers Inc
๐ English
โฆ LIBER โฆ
๐
Complexity Lower Bounds using Linear Algebra (Foundations and Trends in Theoretical Computer Science)
โ Scribed by Satyanarayana V. Lokam
- Publisher
- Now Publishers Inc
- Year
- 2009
- Tongue
- English
- Leaves
- 158
- Category
- Library
โฌ Acquire This Volume
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Average-Case Complexity (Foundations and
โ Andrej Bogdanov, Luca Trevisan
๐ Library
๐
2006
๐ Now Publishers Inc
๐ English
Average-Case Complexity is a thorough survey of the average-case complexity of problems in NP. The study of the average-case complexity of intractable problems began in the 1970s, motivated by two distinct applications: the developments of the foundations of cryptography and the search for methods t
On the Power of Small-Depth Computation
โ Emanuele Viola
๐ Library
๐
2009
๐ Now Publishers Inc
๐ English
Arithmetic Circuits (Foundations and Tre
โ Amir Shpilka, Amir Yehudayoff
๐ Library
๐
2010
๐ Now Publishers Inc
๐ English
Pairwise Independence and Derandomizatio
โ Michael Luby, Avi Wigderson
๐ Library
๐
2006
๐ English
Pairwise Independence and Derandomizatio
โ Michael Luby, Avi Wigderson
๐ Library
๐
2006
๐ Now Publishers Inc
๐ English