Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 26 results in range #1 to #26.

Inversion Attacks on Secure Hash Functions Using sat Solvers: Label: en
Fault Localization and Correction with QBF: Label: en
SAT Solving for Termination Analysis with Polynomial Interpretations: Label: en
A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories: Label: en
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices: Label: en
Minimum 2CNF Resolution Refutations in Polynomial Time: Label: en
Applying Logic Synthesis for Speeding Up SAT: Label: en
Effective Incorporation of Double Look-Ahead Procedures: Label: en
Bounded Universal Expansion for Preprocessing QBF: Label: en
Backdoor Sets of Quantified Boolean Formulas: Label: en
Dynamically Partitioning for Solving QBF: Label: en
A First Step Towards a Unified Proof Checker for QBF: Label: en
On the Boolean Connectivity Problem for Horn Relations: Label: en
Algorithms for Variable-Weighted 2-SAT and Dual Problems: Label: en
Formalizing Dangerous SAT Encodings: Label: en
Satisfiability with Exponential Families: Label: en
From Idempotent Generalized Boolean Assignments to Multi-bit Search: Label: en
Combining Adaptive Noise and Look-Ahead in Local Search for SAT: Label: en
Variable Dependency in Local Search: Prevention Is Better Than Cure: Label: en
Short XORs for Model Counting: From Theory to Practice: Label: en
Matched Formulas and Backdoor Sets: Label: en
Horn Upper Bounds and Renaming: Label: en
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities: Label: en
Solving Multi-objective Pseudo-Boolean Problems: Label: en
Circuit Based Encoding of CNF Formula: Label: en
Mapping CSP into Many-Valued SAT: Label: en