Login / Signup

Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle?

Diptarka ChakrabortySourav ChakrabortyGunjan KumarKuldeep S. Meel
Published in: CoRR (2023)
Keyphrases
  • model counting
  • weighted model counting
  • knowledge compilation
  • search algorithm
  • natural language processing
  • satisfiability problem
  • computational complexity
  • lower bound
  • sat problem