Entity usage

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

1. Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable: Label: en
2. Exact MinSAT Solving: Label: en
3. Green-Tao Numbers and SAT: Label: en
4. An Empirical Study of Optimal Noise and Runtime Distributions in Local Search: Label: en
5. Reconstructing Solutions after Blocked Clause Elimination: Label: en
6. Exploiting Circuit Representations in QBF Solving: Label: en
7. Minimising Deterministic Büchi Automata Precisely Using SAT Solving: Label: en
8. On Moderately Exponential Time for SAT: Label: en
9. Two Techniques for Minimizing Resolution Proofs: Label: en
10. A System for Solving Constraint Satisfaction Problems with SMT: Label: en
11. Improved Local Search for Circuit Satisfiability: Label: en
12. Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT: Label: en
13. Bounds on Threshold of Regular Random k-SAT: Label: en
14. Complexity Results for Linear XSAT-Problems: Label: en
15. The Seventh QBF Solvers Evaluation (QBFEVAL’10): Label: en
16. On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem: Label: en
17. Statistical Methodology for Comparison of SAT Solvers: Label: en
18. Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs: Label: en
19. Improving Unsatisfiability-Based Algorithms for Boolean Optimization: Label: en
20. An Exact Algorithm for the Boolean Connectivity Problem for k-CNF: Label: en
21. Integrating Dependency Schemes in Search-Based QBF Solvers: Label: en
22. SAT Solving with Reference Points: Label: en
23. A Non-prenex, Non-clausal QBF Solver with Game-State Learning: Label: en
24. Symmetry and Satisfiability: An Update: Label: en
25. Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold: Label: en
26. sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning: Label: en
27. Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT: Label: en
28. Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN: Label: en
29. Automated Testing and Debugging of SAT and QBF Solvers: Label: en
30. Proof Complexity of Propositional Default Logic: Label: en
31. Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas: Label: en
32. Improving Stochastic Local Search for SAT with a New Probability Distribution: Label: en
33. The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference: Label: en
34. Zero-One Designs Produce Small Hard SAT Instances: Label: en
35. Simple but Hard Mixed Horn Formulas: Label: en
36. Assignment Stack Shrinking: Label: en