Skip to search formSkip to main contentSkip to account menu

2-satisfiability

Known as: 2-SAT, MAX-2SAT, 2-CNF-SAT 
In computer science, 2-satisfiability is a computational problem of assigning values to variables, each of which has two possible values, in order to… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
This paper introduces SC2LE (StarCraft II Learning Environment), a reinforcement learning environment based on the StarCraft II… 
Highly Cited
2012
Highly Cited
2012
We propose a consumption scheduling mechanism for home area load management in smart grid using integer linear programming (ILP… 
Highly Cited
2006
Highly Cited
2006
This paper focuses on the interactive effects of power and emotion in negotiation. Previous research has shown that negotiators… 
Highly Cited
2005
Highly Cited
1998
Highly Cited
1998
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… 
Review
1997
Review
1997
Based on underlying theories of L2 reading comprehension and text comprehension with multimedia, and in light of the new tools… 
Highly Cited
1995
Highly Cited
1995
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… 
Highly Cited
1995
Highly Cited
1995
  • U. Feige, M. Goemans
  • Proceedings Third Israel Symposium on the Theory…
  • 1995
  • Corpus ID: 2553935
It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this… 
Highly Cited
1994
Highly Cited
1994
We present randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected… 
Highly Cited
1992
Highly Cited
1992
Consider a randomly generated boolean formula F (in the conjunctive normal form) with m clauses of size k over n variables; k is…