Exercises
Multiple Choice
Articles
Open Problems
Login
2 exercises
Tagged:
sat
x
Start over
- to expand, or dig in by adding more tags and revising the query.
Sort By:
trending ▼
date
0
Undergraduate
By
John Doe
on Nov. 3, 2012 | Updated Dec. 6, 2017
Direct reduction from Graph Homomorphism to SAT
The decision problem \(GraphHomo\) is defined as follows: \(GraphHomo = \{\langle G, H\rangle \mid \text{there is a graph homomorphism from G to H}\}\) Give a direct reduction from \(GraphHomo\) to …
Computer Science
Mathematics
Complexity Theory
Graph Theory
Logic
np
reduction
sat
0
Undergraduate
By
Shiva Kintali
on Nov. 14, 2012 | Updated Dec. 6, 2017
Randomized k-SAT algorithm
Consider an instance of SAT with \(m\) clauses, where every clause has exactly \(k\) literals. Give a Las Vegas algorithm that finds an assignment satisfying at least \(m(1-2^{-k})\) clauses, and an…
Mathematics
Probability
conditional expectation
derandomization
expectation
sat
icon
Sign In or Sign Up
icon
Invite Friends
Post Something
x
Select What You'd Like To Post
POST AN ARTICLE
POST AN OPEN PROBLEM
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION
Content Types
Articles
Open Problems
Exercises
Multiple-Choice Questions
Levels
High school
Undergraduate
Graduate
Subjects
Mathematics
Computer Science
Puzzles
Optimization
Trending tags
trees
dynamic programming
polynomials
infinite series
digraphs
fermats little theorem
asymptotic analysis
differentiation
integration
jee
Topics
Algebra
Algorithms
Approximation Algorithms
Calculus
Combinatorial Optimization
Combinatorics
Complexity Theory
Data Structures
Discrete Mathematics
Game Theory
Geometry
Graph Theory
Linear Algebra
Linear Programming
Logic
Mathematical Analysis
Mathematics
Matrix Theory
Number Theory
Optimization
Probability
Programming
Puzzles
Randomized Algorithms
Real Analysis
Trigonometry
×