Optimal query complexity for private sequential learning against eavesdropping
Preprints
Xu, J; Xu, K; Yang, D
September 21, 2019
Duke Scholars
Altmetric Attention Stats
Dimensions Citation Stats
Publication Date
September 21, 2019
Citation
APA
Chicago
ICMJE
MLA
NLM
Xu, J., Xu, K., & Yang, D. (2019). Optimal query complexity for private sequential learning against eavesdropping.
Xu, Jiaming, Kuang Xu, and Dana Yang. “Optimal query complexity for private sequential learning against eavesdropping,” September 21, 2019.
Xu J, Xu K, Yang D. Optimal query complexity for private sequential learning against eavesdropping. 2019.
Xu, Jiaming, et al. Optimal query complexity for private sequential learning against eavesdropping. 21 Sept. 2019.
Xu J, Xu K, Yang D. Optimal query complexity for private sequential learning against eavesdropping. 2019.
Publication Date
September 21, 2019