atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Satisfiability and Algorithms for Non-uniform Random k-SAT

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a power-law degree distribution with α < k/(k−1)Configuration Model k-SAT · Power-law degree distributionssatisfiabilityHurt
Reduce each clause to its two lowest-degree literals, then solve the resulting 2-SATConfiguration Model k-SAT · Power-law degree distributions satisfying condition (2)satisfying-assignment successHelped
Use zeta-distributed degrees rather than uniform or d-regular instancesCryptoMiniSAT 5.6.6 · 3-SAT, tested across formula sizes and average degreesexplored branchesHelped
Increase β for zeta-distributed degreesConfiguration Model 3-SAT · n=106 and n=2·106 variablessatisfiable-formula fractionMixed
Increase β beyond approximately 2.53Algorithm 2 · Zeta-distributed Configuration Model 3-SATalgorithm success probabilityHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy