The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems.
Priyanka MukhopadhyayPublished in: J. Comput. Syst. Sci. (2022)
Keyphrases
- related problems
- coalitional games
- phase transition
- satisfiability problem
- range searching
- stable marriage
- np hard
- closed form
- approximation algorithms
- constraint satisfaction
- sat solvers
- np complete
- computer games
- search strategies
- educational games
- agnostic learning
- convex sets
- nash equilibria
- low degree
- game design
- broadly applicable
- random instances
- stochastic local search
- nash equilibrium
- learning theory
- upper bound
- sat instances
- boolean satisfiability
- sat problem
- game play
- game theory
- biomedical ontologies