{"total":13,"rows":[{"id":"2112.10884","title":"Learning Bayesian Networks in the Presence of Structural Side Information","created":"2021-12-20","cited_by_count":12,"area":null},{"id":"2105.09675","title":"On the Parameterized Complexity of Polytree Learning","created":"2021-05-20","cited_by_count":6,"area":null},{"id":"2204.04009","title":"On Projectivity in Markov Logic Networks","created":"2022-04-08","cited_by_count":5,"area":null},{"id":"2204.02902","title":"Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings","created":"2022-04-06","cited_by_count":3,"area":null},{"id":"2602.10253","title":"The Complexity of Bayesian Network Learning: Revisiting the Superstructure","created":"2026-02-10","cited_by_count":2,"area":null},{"id":"2607.20811","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","created":"2026-07-23","cited_by_count":2,"area":null},{"id":"2312.07103","title":"The Computational Complexity of Concise Hypersphere Classification","created":"2023-12-12","cited_by_count":1,"area":null},{"id":"2303.04339","title":"Learning the Finer Things: Bayesian Structure Learning at the Instantiation Level","created":"2023-03-08","cited_by_count":0,"area":null},{"id":"2305.01089","title":"Computing Expected Motif Counts for Exchangeable Graph Generative Models","created":"2023-05-01","cited_by_count":0,"area":null},{"id":"2312.10219","title":"The Complexity of Optimizing Atomic Congestion","created":"2023-12-15","cited_by_count":0,"area":null},{"id":"2406.15012","title":"Exact discovery is polynomial for certain sparse causal Bayesian networks","created":"2024-06-21","cited_by_count":0,"area":null},{"id":"2511.08091","title":"Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy","created":"2025-11-11","cited_by_count":0,"area":null},{"id":"2605.03622","title":"Exact and Approximate Algorithms for Polytree Learning","created":"2026-05-05","cited_by_count":0,"area":null}],"next_cursor":null}