Backdoors in combinatorial problems and their probabilistic generalizations

DOI10.17223/2226308X/15/23MaRDI QIDQ6898687zbMATH OpenFDO

Authors A. A. Semënov

Publication date 17 November 2025

Published in Prikladnaya Diskretnaya Matematika. Supplement (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17223/2226308X/15/23

zbMATH Keywords

0-1-integer linear programmingbackdoors in combinatorial problemsBoolean satisfiability problem (SAT)

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 3819689 (Why is no real title available?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• The Monte Carlo Method

This page was built for publication: Backdoors in combinatorial problems and their probabilistic generalizations

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