Small unsatisfiable $k$-CNFs with bounded literal occurrence

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Tianwei, Peitl, Tomáš, Szeider, Stefan
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Computational Complexity Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2405.16149