The following pages link to Plingeling (Q19149):
Displaying 50 items.
- SAT race 2015 (Q334795) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Decision procedures. An algorithmic point of view (Q518892) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Machine learning-based restart policy for CDCL SAT solvers (Q1656568) (← links)
- ALIAS: a modular tool for finding backdoors for SAT (Q1656599) (← links)
- PySAT: a Python toolkit for prototyping with SAT oracles (Q1656601) (← links)
- A constraint optimization approach to causal discovery from subsampled time series data (Q1678425) (← links)
- Optimal bounds for the no-show paradox via SAT solving (Q1680092) (← links)
- On the community structure of bounded model checking SAT problems (Q1680243) (← links)
- An empirical study of branching heuristics through the lens of global learning rate (Q1680251) (← links)
- Coverage-based clause reduction heuristics for CDCL solvers (Q1680252) (← links)
- Propagation based local search for bit-precise reasoning (Q1688546) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
- Parallelizing SMT solving: lazy decomposition and conciliation (Q1749390) (← links)
- SAT competition 2020 (Q2060693) (← links)
- Covered clauses are not propagation redundant (Q2096437) (← links)
- OptiLog: a framework for SAT-based systems (Q2118280) (← links)
- Efficient all-UIP learned clause minimization (Q2118297) (← links)
- The \textsc{MergeSat} solver (Q2118329) (← links)
- XOR local search for Boolean Brent equations (Q2118332) (← links)
- Leveraging GPUs for effective clause sharing in parallel SAT solving (Q2118339) (← links)
- Scalable SAT solving in the cloud (Q2118345) (← links)
- Incremental column-wise verification of arithmetic circuits using computer algebra (Q2225473) (← links)
- New ways to multiply \(3 \times 3\)-matrices (Q2229749) (← links)
- Popularity-similarity random SAT formulas (Q2238712) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- On the complexity of reconstructing chemical reaction networks (Q2254073) (← links)
- On propositional coding techniques for the distinguishability of objects in finite sets (Q2272883) (← links)
- Clause vivification by unit propagation in CDCL SAT solvers (Q2287199) (← links)
- Solving SAT in a distributed cloud: a portfolio approach (Q2299084) (← links)
- A computational complexity analysis of tunable type inference for Generic Universe Types (Q2304565) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Community and LBD-based clause sharing policy for parallel SAT solving (Q2661331) (← links)
- Distributed cube and conquer with Paracooba (Q2661340) (← links)
- Reproducible efficient parallel SAT solving (Q2661341) (← links)
- Improving implementation of SAT competitions 2017--2019 winners (Q2661342) (← links)
- Simplified and improved separations between regular and general resolution by lifting (Q2661346) (← links)
- Mycielski graphs and PR proofs (Q2661347) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres (Q2675865) (← links)
- Tighter bounds on directed Ramsey number \(R(7)\) (Q2676760) (← links)
- Cryptanalysis of Ascon (Q2790053) (← links)
