 | 2012 |
|---|
| 12 |       | Nir Ailon,
Zohar Shay Karnin:
A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity
CoRR abs/1204.6588: (2012) |
| 11 | | Zohar Shay Karnin,
Yuval Rabani,
Amir Shpilka:
Explicit Dimension Reduction and Its Applications.
SIAM J. Comput. 41(1): 219-249 (2012) |
| 2011 |
|---|
| 10 | | Zohar Shay Karnin,
Yuval Rabani,
Amir Shpilka:
Explicit Dimension Reduction and Its Applications.
IEEE Conference on Computational Complexity 2011: 262-272 |
| 9 | | Zohar Shay Karnin:
Deterministic construction of a high dimensional lp section in l1n for any p<2.
STOC 2011: 645-654 |
| 8 | | Zohar Shay Karnin,
Amir Shpilka:
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in.
Combinatorica 31(3): 333-364 (2011) |
| 2010 |
|---|
| 7 | | Zohar Shay Karnin,
Partha Mukhopadhyay,
Amir Shpilka,
Ilya Volkovich:
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in.
STOC 2010: 649-658 |
| 6 | | Zohar Shay Karnin:
Deterministic Construction of a high dimensional lp section in l1n for any p<2.
Electronic Colloquium on Computational Complexity (ECCC) 17: 162 (2010) |
| 2009 |
|---|
| 5 | | Zohar Shay Karnin,
Amir Shpilka:
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in.
IEEE Conference on Computational Complexity 2009: 274-285 |
| 4 | | Zohar Shay Karnin,
Partha Mukhopadhyay,
Amir Shpilka,
Ilya Volkovich:
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in.
Electronic Colloquium on Computational Complexity (ECCC) 16: 116 (2009) |
| 3 | | Zohar Shay Karnin,
Yuval Rabani,
Amir Shpilka:
Explicit Dimension Reduction and Its Applications.
Electronic Colloquium on Computational Complexity (ECCC) 16: 121 (2009) |
| 2008 |
|---|
| 2 | | Zohar Shay Karnin,
Amir Shpilka:
Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In.
IEEE Conference on Computational Complexity 2008: 280-291 |
| 2007 |
|---|
| 1 | | Zohar Shay Karnin,
Amir Shpilka:
Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in.
Electronic Colloquium on Computational Complexity (ECCC) 14(042): (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page