Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

50 relations
Approximation algorithmBacktrackingBinary imageBoolean 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
This paper introduces SC2LE (StarCraft II Learning Environment), a reinforcement learning environment based on the StarCraft II… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2012
Highly Cited
2012
An integer linear programming based optimization for home demand-side management in smart grid
We propose a consumption scheduling mechanism for home area load management in smart grid using integer linear programming (ILP… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
2007
2007
Efficient algorithms for generalized Stable Marriage and Roommates problems
We consider a generalization of the Stable Roommates problem (sr), in which preference lists may be partially ordered and… Expand
  • figure 1
Highly Cited
2006
Highly Cited
2006
Power and emotion in negotiation: Power moderates the interpersonal effects of anger and happiness on concession making
This paper focuses on the interactive effects of power and emotion in negotiation. Previous research has shown that negotiators… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2005
Highly Cited
2005
A new algorithm for optimal 2-constraint satisfaction and its implications
We present a novel method for exactly solving (in fact, counting solutions to) general constraint satisfaction optimization with… Expand
Highly Cited
1998
Highly Cited
1998
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… Expand
Highly Cited
1995
Highly Cited
1995
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… Expand
  • figure 1
  • figure 2
  • table I
  • table II
Highly Cited
1994
Highly Cited
1994
.879-approximation algorithms for MAX CUT and MAX 2SAT
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)
Consider a randomly generated boolean formula F (in the conjunctive normal form) with m clauses of size k over n variables; k is… Expand
Highly Cited
1984
Highly Cited
1984
A simplified NP-complete satisfiability problem
  • C. Tovey
  • Discret. Appl. Math.
  • 1984
    • Corpus ID: 16563610
3-SAT is NP-complete when restricted to instances where each variable appears in at most four clauses. When no variable appears… 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