ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2011.13721
  4. Cited By
Lower Bounds for Approximate Knowledge Compilation

Lower Bounds for Approximate Knowledge Compilation

International Joint Conference on Artificial Intelligence (IJCAI), 2020
27 November 2020
Alexis de Colnet
S. Mengel
ArXiv (abs)PDFHTML

Papers citing "Lower Bounds for Approximate Knowledge Compilation"

2 / 2 papers shown
On the Hardness of Approximating Distributions with Tractable Probabilistic Models
On the Hardness of Approximating Distributions with Tractable Probabilistic Models
John Leland
YooJung Choi
TPM
407
1
0
02 Jun 2025
Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms
Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms
Tomás Capdevielle
Santiago Cifuentes
FAtt
235
0
0
06 May 2025
1
Page 1 of 1