AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

General Bounds on Satisfiability Thresholds for Random CSPs via Fourier Analysis

Colin Wei, Stefano Ermon

AAAI 2017 · Learning theory and algorithms › Sample complexity · approach: Neural network approximation theory · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 lower-bound formula that incorporates constraint-specific Fourier-spectrum symmetryRandom boolean CSPs · General boolean CSPslower bound on satisfiability thresholdImproved
Weight satisfying assignments to reduce correlations before applying the second moment methodSecond-moment analysis of random CSPs · General boolean CSPslower bound on satisfiability probabilityImproved
Use the unweighted solution count directly in the second moment methodRandom k-SAT · k-SATsecond-moment lower boundHurt
Use the unweighted solution count directly in the second moment methodRandom k-NAESAT · k-NAESATsecond-moment lower boundImproved
Apply the proposed lower and first-moment upper bounds to TRIBES constraintsFourier-based satisfiability-threshold bounds · TRIBES random CSPstightness of lower bound relative to upper boundMixed

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