Author of the publication

The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas.

, , and . IJCAI, page 600-606. ijcai.org, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Counting Maximal Satisfiable Subsets., and . AAAI, page 3651-3660. AAAI Press, (2021)ApproxASP - a Scalable Approximate Answer Set Counter., , , , , and . AAAI, page 5755-5764. AAAI Press, (2022)Designing New Phase Selection Heuristics., and . SAT, volume 12178 of Lecture Notes in Computer Science, page 72-88. Springer, (2020)Approximate Counting of Minimal Unsatisfiable Subsets., and . CAV (1), volume 12224 of Lecture Notes in Computer Science, page 439-462. Springer, (2020)Principled network reliability approximation: A counting-based approach., , , and . Reliab. Eng. Syst. Saf., (2019)Knowledge Compilation meets Uniform Sampling., , , and . LPAR, volume 57 of EPiC Series in Computing, page 620-636. EasyChair, (2018)Engineering an Efficient Boolean Functional Synthesis Engine., , , and . ICCAD, page 1-9. IEEE, (2021)Estimating the Size of Union of Sets in Streaming Models., , and . PODS, page 126-137. ACM, (2021)"How Biased are Your Features?": Computing Fairness Influence Functions with Global Sensitivity Analysis., , and . FAccT, page 138-148. ACM, (2023)Scalable Quantitative Verification For Deep Neural Networks., , , and . ICSE, page 312-323. IEEE, (2021)