Feige’s conjecture on random 3-SAT

E2019159 UNEXPLORED

Feige’s conjecture on random 3-SAT is a prominent open conjecture in computational complexity that posits a sharp satisfiability threshold for random 3-SAT formulas and has deep implications for the hardness of approximation.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (3)

Label	Occurrences
Feige’s conjecture on random 3-SAT canonical	1
Feige’s conjecture relating random 3-SAT to worst-case complexity	1
Feige’s threshold conjecture for random 3-SAT	1

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

Uriel Feige → knownFor → Feige’s conjecture on random 3-SAT ⓘ

Uriel Feige → notableWork → Feige’s threshold conjecture for random 3-SAT ⓘ

linked to: Feige’s conjecture on random 3-SAT

Uriel Feige → hasContribution → Feige’s conjecture relating random 3-SAT to worst-case complexity ⓘ

linked to: Feige’s conjecture on random 3-SAT