Editor’s note

  title={Editor’s note},
  author={Alexander Ivrii and Sharad Malik and Kuldeep S. Meel and Moshe Y. Vardi},
Constrained sampling and counting are two fundamental problems arising in domains ranging from artificial intelligence and security, to hardware and software testing. Recent approaches to approximate solutions for these problems rely on employing SAT solvers and universal hash functions that are typically encoded as XOR constraints of length n/2 for an input formula with n variables. As the runtime performance of SAT solvers heavily depends on the length of XOR constraints, recent research… CONTINUE READING
0 Extracted Citations
35 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…