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 24 results in range #1 to #24.

The Community Structure of SAT Formulas: Label: en
Perfect Hashing and CNF Encodings of Cardinality Constraints: Label: en
Conflict-Driven XOR-Clause Learning: Label: en
Finding Efficient Circuits for Ensemble Computation: Label: en
Fixed-Parameter Tractability of Satisfying beyond the Number of Variables: Label: en
Parameterized Complexity of Weighted Satisfiability Problems: Label: en
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas: Label: en
Interpolant Strength Revisited: Label: en
On Efficient Computation of Variable MUSes: Label: en
Improvements to Core-Guided Binary Search for MaxSAT: Label: en
Preprocessing in Incremental SAT: Label: en
Efficient SAT Solving under Assumptions: Label: en
Faulty Interaction Identification via Constraint Solving and Optimization: Label: en
Generalized Property Directed Reachability: Label: en
Henkin Quantifiers and Boolean Formulae: Label: en
Solving QBF with Counterexample Guided Refinement: Label: en
On Sequent Systems and Resolution for QBFs: Label: en
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas: Label: en
Strong Backdoors to Nested Satisfiability: Label: en
Computing Resolution-Path Dependencies in Linear Time ,: Label: en
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning: Label: en
Off the Trail: Re-examining the CDCL Algorithm: Label: en
Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break: Label: en
Understanding IC3: Label: en