Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
Search by expertise, name or affiliation
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily
Tobias Friedrich
, Frank Neumann
, Ralf Rothenberger
,
Andrew M. Sutton
Computer Science (Duluth)
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
SAT Formulas
100%
Random SAT
100%
Random Satisfiability
100%
Balance Condition
40%
Power Law
20%
Non-uniformity
20%
High Probability
20%
Unique Solution
20%
Real-world Application
20%
Total Variation Distance
20%
Greedy Algorithm
20%
Plant Model
20%
Heterogeneous Distribution
20%
Algorithmic Complexity
20%
Skewed Distribution
20%
Logarithmic Density
20%
Geometric Formula
20%
Mathematics
Nonuniform
100%
Probability Theory
50%
Greedy Algorithm
25%
unique solution φ
25%
Power Law
25%
Skewed Distribution
25%
Algorithmic Complexity
25%
Total Variation Distance
25%