Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution

Oleksii Omelchenko, Andrei A. Bulatov. Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022. pages 3804-3812, AAAI Press, 2022. [doi]

@inproceedings{OmelchenkoB22,
  title = {Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution},
  author = {Oleksii Omelchenko and Andrei A. Bulatov},
  year = {2022},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/20295},
  researchr = {https://researchr.org/publication/OmelchenkoB22},
  cites = {0},
  citedby = {0},
  pages = {3804-3812},
  booktitle = {Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022},
  publisher = {AAAI Press},
  isbn = {978-1-57735-876-3},
}