Journal cover

computational complexity

Volume 18, issue 1, April 2009

5 articles in this issue

Extractors And Rank Extractors For Polynomial Sources

Authors
- Zeev Dvir
- Ariel Gabizon
- Avi Wigderson
- Content type: OriginalPaper
- Published: 23 April 2009
- Pages: 1 - 58
The Black-Box Query Complexity of Polynomial Summation

Authors (first, second and last of 4)
- Ali Juma
- Valentine Kabanets
- Amir Shpilka
- Content type: OriginalPaper
- Published: 20 April 2009
- Pages: 59 - 79
On Defining Integers And Proving Arithmetic Circuit Lower Bounds

Authors
- Peter Bürgisser
- Content type: OriginalPaper
- Published: 23 April 2009
- Pages: 81 - 103
Robust Algorithms For Generalized Pham Systems

Authors
- Ezequiel Dratman
- Guillermo Matera
- Ariel Waissbein
- Content type: OriginalPaper
- Published: 24 April 2009
- Pages: 105 - 154
Nullstellensätze for Zero–Dimensional Gröbner Bases

Authors
- Amir Hashemi
- Content type: OriginalPaper
- Published: 20 April 2009
- Pages: 155 - 168