Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random k-SAT

From MaRDI portal
Publication:5034546

DOI10.1080/09720529.2020.1711602OpenAlexW3034683615MaRDI QIDQ5034546

Hera Antonopoulou

Publication date: 18 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2020.1711602







Cites Work




This page was built for publication: Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random k-SAT