Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Shraibman, Adi
42  Ergebnisse:
Personensuche X
?
1

Around the log-rank conjecture:

Lee, Troy ; Shraibman, Adi
Israel Journal of Mathematics.  256 (2023)  2 - p. 441-477 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Revisiting the Risk Factors for Endometriosis: A Machine Le..:

Blass, Ido ; Sahar, Tali ; Shraibman, Adi...
Journal of Personalized Medicine.  12 (2022)  7 - p. 1114 , 2022
Link: https://doi.org/10.3390/..
 
?
3

Property Testing of the Boolean and Binary Rank:

Parnas, Michal ; Ron, Dana ; Shraibman, Adi
Theory of Computing Systems.  65 (2021)  8 - p. 1193-1210 , 2021
Link: https://doi.org/10.1007/..
 
?
4

An improved protocol for the exactly-N problem*:

, In: Proceedings of the 36th Computational Complexity Conference,
Linial, Nati ; Shraibman, Adi - p. 1 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

The corruption bound, log-rank, and communication complexit:

Shraibman, Adi
Information Processing Letters.  141 (2019)  - p. 16-21 , 2019
Link: https://doi.org/10.1016/..
 
?
6

Nondeterministic communication complexity with help and gra..:

Shraibman, Adi
Theoretical Computer Science.  782 (2019)  - p. 1-10 , 2019
Link: https://doi.org/10.1016/..
 
?
7

The Boolean rank of the uniform intersection matrix and a f..:

Parnas, Michal ; Ron, Dana ; Shraibman, Adi
Linear Algebra and its Applications.  574 (2019)  - p. 67-83 , 2019
Link: https://doi.org/10.1016/..
 
?
8

A note on multiparty communication complexity and the Hales..:

Shraibman, Adi
Information Processing Letters.  139 (2018)  - p. 44-48 , 2018
Link: https://doi.org/10.1016/..
 
?
9

The augmentation property of binary matrices for the binary..:

Parnas, Michal ; Shraibman, Adi
Linear Algebra and its Applications.  556 (2018)  - p. 70-99 , 2018
Link: https://doi.org/10.1016/..
 
?
10

The approximate rank of a matrix and its algorithmic applic..:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,
Alon, Noga ; Lee, Troy ; Shraibman, Adi. - p. 675-684 , 2013
Link: https://dl.acm.org/doi/1..
 
?
11

Deterministic algorithms for matrix completion:

Heiman, Eyal ; Schechtman, Gideon ; Shraibman, Adi
Random Structures & Algorithms.  45 (2013)  2 - p. 306-317 , 2013
Link: https://doi.org/10.1002/..
 
?
12

Disjointness is Hard in the Multiparty Number-on-the-Forehe..:

Lee, Troy ; Shraibman, Adi
computational complexity.  18 (2009)  2 - p. 309-336 , 2009
Link: https://doi.org/10.1007/..
 
?
13

Learning Complexity vs Communication Complexity:

LINIAL, NATI ; SHRAIBMAN, ADI
Combinatorics, Probability and Computing.  18 (2009)  1-2 - p. 227-245 , 2009
Link: https://doi.org/10.1017/..
 
?
14

A Direct Product Theorem for Discrepancy:

, In: 2008 23rd Annual IEEE Conference on Computational Complexity,
Lee, Troy ; Shraibman, Adi ; Spalek, Robert - p. None , 2008
Link: https://doi.org/10.1109/..
 
?
15

Lower Bounds for Local Versions of Dimension Reductions:

Schechtman, Gideon ; Shraibman, Adi
Discrete & Computational Geometry.  41 (2008)  2 - p. 273-283 , 2008
Link: https://doi.org/10.1007/..
 
1-15