YalSAT

swMATH31644MaRDI QIDQ43355FDOQ43355

Author name not available (Why is that?)

Cited In (24)

• Improving implementation of SAT competitions 2017--2019 winners
• Efficient all-UIP learned clause minimization
• XOR local search for Boolean Brent equations
• Mycielski graphs and PR proofs
• New ways to multiply \(3 \times 3\)-matrices
• Popularity-similarity random SAT formulas
• Community and LBD-based clause sharing policy for parallel SAT solving
• Local Negative Circuits and Cyclic Attractors in Boolean Networks with at most Five Components
• Three-dimensional stable matching with cyclic preferences
• On propositional coding techniques for the distinguishability of objects in finite sets
• On dispersable book embeddings
• A constraint optimization approach to causal discovery from subsampled time series data
• Scalable SAT solving in the cloud
• Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
• An adaptive prefix-assignment technique for symmetry reduction
• Title not available (Why is that?)
• Clause vivification by unit propagation in CDCL SAT solvers
• Propagation based local search for bit-precise reasoning
• Merging Variables: One Technique of Search in Pseudo-Boolean Optimization
• On the maximal minimal cube lengths in distinct DNF tautologies
• The \textsc{MergeSat} solver
• Truth Assignments as Conditional Autarkies
• SAT competition 2020
• Incremental column-wise verification of arithmetic circuits using computer algebra

This page was built for software: YalSAT