Publication | Closed Access

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications

Mathematical ProgrammingEngineeringParameterized ComplexityAutomated ReasoningLower BoundSat SolvingFormal MethodsSatisfied ClausesComputational ComplexityExtremal CombinatoricsNew Lower BoundComputer ScienceDiscrete MathematicsCombinatorial OptimizationSatisfiabilityMaximum Number