The following pages link to MiniSat (Q13332):
Displaying 50 items.
- Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator (Q3525677) (← links)
- SAT graph-based representation: A new perspective (Q3527692) (← links)
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study (Q3527696) (← links)
- LCF-Style Propositional Simplification with BDDs and SAT Solvers (Q3543649) (← links)
- Imperative Functional Programming with Isabelle/HOL (Q3543655) (← links)
- COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES (Q3552516) (← links)
- (Q3562927) (← links)
- Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms (Q3569744) (← links)
- New Algorithms for Deciding the Siphon-Trap Property (Q3569871) (← links)
- Towards a Design Flow for Reversible Logic (Q3577129) (← links)
- Solving Equation Systems by Agreeing and Learning (Q3578471) (← links)
- Fast Set Bounds Propagation Using a BDD-SAT Hybrid (Q3579357) (← links)
- Approximate Model-Based Diagnosis Using Greedy Stochastic Search (Q3579359) (← links)
- Testing and debugging techniques for answer set solver development (Q3585183) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases (Q3587716) (← links)
- Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking (Q3600486) (← links)
- (Q3604000) (← links)
- (Q3604006) (← links)
- Predictive Labeling with Dependency Pairs Using SAT (Q3608786) (← links)
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms (Q3611786) (← links)
- Eliminating Redundant Clauses in SAT Instances (Q3612408) (← links)
- Circuit Based Encoding of CNF Formula (Q3612453) (← links)
- Applying Logic Synthesis for Speeding Up SAT (Q3612472) (← links)
- SAT Solving for Termination Analysis with Polynomial Interpretations (Q3612476) (← links)
- Inversion Attacks on Secure Hash Functions Using sat Solvers (Q3612479) (← links)
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (Q3617770) (← links)
- (Q3620436) (← links)
- (Q3620437) (← links)
- (Q3620438) (← links)
- (Q3620439) (← links)
- (Q3624035) (← links)
- (Q3624109) (← links)
- Test Pattern Generation using Boolean Proof Engines (Q3631306) (← links)
- Automatic Termination (Q3636815) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure (Q3636881) (← links)
- Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
- Finding Lean Induced Cycles in Binary Hypercubes (Q3637155) (← links)
- Boundary Points and Resolution (Q3637164) (← links)
- Dynamic Symmetry Breaking by Simulating Zykov Contraction (Q3637171) (← links)
- Generalizing Core-Guided Max-SAT (Q3637181) (← links)
- (Q3639754) (← links)
- (Q3639755) (← links)
- Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT (Q3648465) (← links)
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem (Q3651486) (← links)
- Block Ciphers: Algebraic Cryptanalysis and Gröbner Bases (Q3652824) (← links)
- Putting ABox Updates into Action (Q3655202) (← links)
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme (Q3655207) (← links)
- (Q4553279) (← links)
