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.

A Max-SAT Inference-Based Pre-processing for Max-Clique: Label: en
Online Estimation of SAT Solving Runtime: Label: en
A Decision-Making Procedure for Resolution-Based SAT-Solvers: Label: en
Complexity and Algorithms for Well-Structured k-SAT Instances: Label: en
Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms: Label: en
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers: Label: en
Attacking Bivium Using SAT Solvers: Label: en
Designing an Efficient Hardware Implication Accelerator for SAT Solving: Label: en
New Results on the Phase Transition for Random Quantified Boolean Formulas: Label: en
Adaptive Restart Strategies for Conflict Driven SAT Solvers: Label: en
A Generalized Framework for Conflict Analysis: Label: en
A Preprocessor for Max-SAT Solvers: Label: en
Modelling Max-CSP as Partial Max-SAT: Label: en
Finding Guaranteed MUSes Fast: Label: en
Regular and General Resolution: An Improved Separation: Label: en
Local Restarts: Label: en
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning: Label: en
How Many Conflicts Does It Need to Be Unsatisfiable?: Label: en
A CNF Class Generalizing Exact Linear Formulas: Label: en
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms: Label: en
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions: Label: en
Nenofex: Expanding NNF for QBF Solving: Label: en
Searching for Autarkies to Trim Unsatisfiable Clause Sets: Label: en
Improvements to Hybrid Incremental SAT Algorithms: Label: en
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors: Label: en
Computation of Renameable Horn Backdoors: Label: en