Clause-connected versions of the satisfiability problem

DOI10.33048/SEMI.2024.21.031MaRDI QIDQ6643535zbMATH OpenFDO

Authors Vladimir Popov

Publication date 26 November 2024

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/SEMI.2024.21.031

zbMATH Keywords

computational complexityNP-completesatisfiability problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• Solving \textsc{minones-2-sat} as fast as \textsc{vertex cover}

This page was built for publication: Clause-connected versions of the satisfiability problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643535)