z-logo
open-access-imgOpen Access
On Probabilistic Generalization of Backdoors in Boolean Satisfiability
Author(s) -
Alexander Semenov,
Artem Pavlenko,
Daniil Chivilikhin,
Stepan Kochemazov
Publication year - 2022
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v36i9.21277
Subject(s) - boolean function , boolean satisfiability problem , backdoor , probabilistic logic , satisfiability , generalization , mathematics , maximum satisfiability problem , algorithm , discrete mathematics , combinatorics , computer science , mathematical analysis , statistics , computer security

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom