A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1104.2818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels: Annotated, Proper and Induced / 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: Lower Bounds for Kernelizations and Other Preprocessing Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Max Lin-2 above average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications / 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: Implications of forbidden structures for extremal algorithmic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Algorithms for above Average Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets / 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: Parameterizing above or below guaranteed values / 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: Q5710169 / 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: On Local Versus Global Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank

Latest revision as of 10:27, 4 July 2024

scientific article
Language Label Description Also known as
English
A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application
scientific article

    Statements

    A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (English)
    0 references
    19 August 2011
    0 references
    0 references
    0 references

    Identifiers