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 (opens in a new tab)

Related topics

Related topics

50 relations
Approximation algorithmBacktrackingBinary imageBoolean expression

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Improving Learning in Networked Data by Combining Explicit and Mined Links
This paper is about using multiple types of information for classification of networked data in a semi-supervised setting: given… 
2007
2007
Language skills and earnings: Evidence from a pre-industrial economy in the Bolivian Amazon
2005
2005
Improving exact algorithms for MAX-2-SAT
We study three new techniques that will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is… 
2004
2004
Study of Lower Bound Functions for MAX-2-SAT
Recently. several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm… 
Review
2004
Review
2004
Clustering of Time-Course Gene Expression Data
Microarray experiments have been used to measure genes’ expression levels under different cellular conditions or along certain… 
Highly Cited
2003
Highly Cited
2003
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Review
1996
Review
1996
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT
DIMACS Series in Discrete Mathematicsand Theoretical Computer ScienceVolume00, 19xxA Branch and Cut Algorithm for MAX-SAT and… 
1993
1993
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems
Maximum satissability (MAX-SAT) is an extension of satissability (SAT), in which a partial solution is sought that satisses the… 
1992
1992
Interactions of bacteria with cadmium
Cadmium pollution arises mainly from contamination of minerals used in agriculture and from industrial processes. The usual… 
Highly Cited
1986
Highly Cited
1986
Partitioned-charge-based modeling of bipolar transistors for non-quasi-static circuit simulation
The concept of partitioned-charge-based (PC) modeling of bipolar transistors is developed and demonstrated, and shown to be… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)