- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i11 |      | Michael A. Forbes, Amir Shpilka: Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. CoRR abs/1303.0084 (2013) |
| i10 | | Michael A. Forbes, Amir Shpilka: Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 20: 33 (2013) |
| 2012 | ||
| c2 | | Michael A. Forbes, Amir Shpilka: On identity testing of tensors, low-rank recovery and compressed sensing. STOC 2012: 163-172 |
| i9 | | Michael A. Forbes, Amir Shpilka: Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs. CoRR abs/1209.2408 (2012) |
| i8 | | Michael A. Forbes, Amir Shpilka: Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 19: 115 (2012) |
| 2011 | ||
| j1 | | Jim Lawrence, Raghu Kacker, Yu Lei, D. Richard Kuhn, Michael A. Forbes: A Survey of Binary Covering Arrays. Electr. J. Comb. 18(1) (2011) |
| c1 | | Boris Alexeev, Michael A. Forbes, Jacob Tsimerman: Tensor Rank: Some Lower and Upper Bounds. IEEE Conference on Computational Complexity 2011: 283-291 |
| i7 | | Boris Alexeev, Michael A. Forbes, Jacob Tsimerman: Tensor Rank: Some Lower and Upper Bounds. CoRR abs/1102.0072 (2011) |
| i6 | | Michael A. Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha: Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant. CoRR abs/1104.4557 (2011) |
| i5 | | Alessandro Chiesa, Michael A. Forbes: Improved Soundness for QMA with Multiple Provers. CoRR abs/1108.2098 (2011) |
| i4 | | Michael A. Forbes, Amir Shpilka: On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing. CoRR abs/1111.0663 (2011) |
| i3 | | Boris Alexeev, Michael A. Forbes, Jacob Tsimerman: Tensor Rank: Some Lower and Upper Bounds. Electronic Colloquium on Computational Complexity (ECCC) 18: 10 (2011) |
| i2 | | Alessandro Chiesa, Michael A. Forbes: Improved Soundness for QMA with Multiple Provers. Electronic Colloquium on Computational Complexity (ECCC) 18: 110 (2011) |
| i1 | | Michael A. Forbes, Amir Shpilka: On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing. Electronic Colloquium on Computational Complexity (ECCC) 18: 147 (2011) |
| 1 | Boris Alexeev | |
| 2 | Alessandro Chiesa | |
| 3 | Raghu Kacker | |
| 4 | Neeraj Kayal | |
| 5 | D. Richard Kuhn | |
| 6 | Jim Lawrence | |
| 7 | Yu Lei | |
| 8 | Rajat Mittal | |
| 9 | Chandan Saha | |
| 10 | Amir Shpilka | |
| 11 | Jacob Tsimerman |
Colors in the list of coauthors
Last update Wed May 22 12:11:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page