Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,489,150 papers from all fields of science
Search
Sign In
Create Free Account
2-satisfiability
Known as:
2-SAT
, MAX-2SAT
, 2-CNF-SAT
Expand
In computer science, 2-satisfiability is a computational problem of assigning values to variables, each of which has two possible values, in order to…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
50 relations
Approximation algorithm
Backtracking
Binary image
Boolean expression
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
StarCraft II: A New Challenge for Reinforcement Learning
Oriol Vinyals
,
Timo Ewalds
,
+22 authors
Rodney Tsing
ArXiv
2017
Corpus ID: 28808621
This paper introduces SC2LE (StarCraft II Learning Environment), a reinforcement learning environment based on the StarCraft II…
Expand
Highly Cited
2012
Highly Cited
2012
An integer linear programming based optimization for home demand-side management in smart grid
Ziming Zhu
,
Jie Tang
,
S. Lambotharan
,
W. Chin
,
Z. Fan
IEEE PES Innovative Smart Grid Technologies (ISGT…
2012
Corpus ID: 2560440
We propose a consumption scheduling mechanism for home area load management in smart grid using integer linear programming (ILP…
Expand
Highly Cited
2006
Highly Cited
2006
Power and emotion in negotiation: Power moderates the interpersonal effects of anger and happiness on concession making
G. A. Kleef
,
C. Dreu
,
Davide Pietroni
,
A. Manstead
2006
Corpus ID: 375767
This paper focuses on the interactive effects of power and emotion in negotiation. Previous research has shown that negotiators…
Expand
Highly Cited
2005
Highly Cited
2005
A new algorithm for optimal 2-constraint satisfaction and its implications
Ryan Williams
Theor. Comput. Sci.
2005
Corpus ID: 7179148
Highly Cited
1998
Highly Cited
1998
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
T. Feder
,
Moshe Y. Vardi
SIAM J. Comput.
1998
Corpus ID: 16195937
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this…
Expand
Review
1997
Review
1997
RESEARCH ON TEXT COMPREHENSION IN MULTIMEDIA ENVIRONMENTS
Dorothy M. Chun
,
J. Plass
1997
Corpus ID: 51806572
Based on underlying theories of L2 reading comprehension and text comprehension with multimedia, and in light of the new tools…
Expand
Highly Cited
1995
Highly Cited
1995
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. Goemans
,
David P. Williamson
JACM
1995
Corpus ID: 15794408
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems…
Expand
Highly Cited
1995
Highly Cited
1995
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
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…
Expand
Highly Cited
1994
Highly Cited
1994
.879-approximation algorithms for MAX CUT and MAX 2SAT
M. Goemans
,
David P. Williamson
STOC '94
1994
Corpus ID: 16733112
We present randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected…
Expand
Highly Cited
1992
Highly Cited
1992
Mick gets some (the odds are on his side) (satisfiability)
V. Chvátal
,
B. Reed
Proceedings., 33rd Annual Symposium on…
1992
Corpus ID: 5575389
Consider a randomly generated boolean formula F (in the conjunctive normal form) with m clauses of size k over n variables; k is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE