A new upper bound for \(( n , 3)\)-MAX-SAT
type: Item
instance of: scholarly article
title: A new upper bound for \(( n , 3)\)-MAX-SAT
zbMATH Open document ID: 1261.68068
author: I. A. Bliznets
published in: Journal of Mathematical Sciences (New York)
publication date: 2013-04-09T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6152341
zbMATH Keywords: upper bound
zbMATH Keywords: maximum satisdiability problem
zbMATH Keywords: MAX-SAT
MaRDI profile type: Publication
full work available at URL: s10958-012-1101-z
OpenAlex ID: W2009777252
cites work: Q3044338
cites work: 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
cites work: A full derandomization of schöning's k-SAT algorithm
cites work: Parameterized and Exact Computation
cites work: Theory and Applications of Satisfiability Testing
cites work: A simplified NP-complete MAXSAT problem
cites work: A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
cites work: Guided Search and a Faster Deterministic Algorithm for 3-SAT
cites work: A new algorithm for optimal 2-constraint satisfaction and its implications
cites work: New Bounds for MAX-SAT by Clause Learning
cites work: MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
cites work: Algorithms – ESA 2005
DOI: 10.1007/S10958-012-1101-Z
description: scientific article; zbMATH DE number 6152341