Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
On the maximum satisfiability of random formulas
Dimitris Achlioptas
,
Assaf Naor
, Yuval Peres
Research output
:
Contribution to journal
›
Conference article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the maximum satisfiability of random formulas'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
CNF Formulas
100%
Maximum Satisfiability
100%
Random Formulas
100%
Canonical Problems
33%
Random Instances
33%
Tight Bounds
33%
Asymptotically-tight
33%
NP-complete Problem
33%
Mathematics
Probability Theory
100%