A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application
description / endescription / en
scientific article
scientific article; zbMATH DE number 5823282
Property / title
 
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application (English)
Property / title: A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1309.68089 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-17493-3_10 / rank
 
Normal rank
Property / published in
 
Property / published in: Parameterized and Exact Computation / rank
 
Normal rank
Property / publication date
 
7 December 2010
Timestamp+2010-12-07T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 7 December 2010 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5823282 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118469858 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3125125795 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1004.0526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels: Annotated, Proper and Induced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Kernelizations and Other Preprocessing Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implications of forbidden structures for extremal algorithmic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Satisfaction of k-Satisfiable Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Partial Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of partial satisfaction. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Local Versus Global Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>E</i> <sub>11</sub> and M theory / rank
 
Normal rank

Latest revision as of 21:33, 5 July 2024

scientific article; zbMATH DE number 5823282
  • A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application
Language Label Description Also known as
English
A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications
scientific article; zbMATH DE number 5823282
  • A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application

Statements

A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (English)
0 references
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application (English)
0 references
0 references
21 November 2012
0 references
7 December 2010
0 references
MaxSAT
0 references
lower bound
0 references
2-satisfiable
0 references
fixed parameter tractable
0 references
kernel
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references