Veedu, M. S., Deka, D., & Salapaka, M. V. (2023). Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs.
Chicago Style (17th ed.) CitationVeedu, Mishfad Shaikh, Deepjyoti Deka, and Murti V. Salapaka. Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs. 2023.
MLA (9th ed.) CitationVeedu, Mishfad Shaikh, et al. Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs. 2023.
Warning: These citations may not always be 100% accurate.