Abstract: Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic ...
Ask the publishers to restore access to 500,000+ books. An icon used to represent a menu that can be toggled by interacting with this icon. A line drawing of the Internet Archive headquarters building ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback