Veedu, M. S., Deka, D., & Salapaka, M. V. (2023). Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs.
Chicago-Zitierstil (17. Ausg.)Veedu, Mishfad Shaikh, Deepjyoti Deka, und Murti V. Salapaka. Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs. 2023.
MLA-Zitierstil (9. Ausg.)Veedu, Mishfad Shaikh, et al. Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs. 2023.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.