Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

JAL
2000

favoriteEmaildiscussreport

82views more JAL 2000»

New Upper Bounds for Maximum Satisfiability

13 years 10 months ago

New Upper Bounds for Maximum Satisfiability

Download theinf1.informatik.uni-jena.de

The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses. This paper describes exact algorithms that provide new upper bounds for MaxSat.

Rolf Niedermeier, Peter Rossmanith

Real-time Traffic

Boolean Formula | Conjunctive Normal Form | JAL 2000 | Maximum Satisfiability Problem |

claim paper

Related Content

» A New Upper Bound for Max2Sat A GraphTheoretic Approach

» New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs

» New Upper Bounds for MaxSat

» Maximum common subgraph some upper bound and lower bound results

» On the Fingerprinting Capacity Under the Marking Assumption

» RNA Folding Including Pseudoknots A New Parameterized Algorithm and Improved Upper Bound

» A new upper bound on the cyclic chromatic number

» New algorithms for singly linearly constrained quadratic programs subject to lower and upp...

» Improved upper bounds on sizes of codes

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JAL
Authors	Rolf Niedermeier, Peter Rossmanith

Comments (0)