Solving MAX-\(r\)-SAT above a tight lower bound (Q644808): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms with large domination ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Étude des coefficients de Fourier des fonctions de \(L^ p(G)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arrangement problem parameterized above guaranteed value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of minimum profile problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betweenness parameterized above tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Approach to Problems Parameterized above or below Tight Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the advantage over a random assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077442 / 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: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving exact algorithms for MAX-2-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank
 
Normal rank

Latest revision as of 15:34, 4 July 2024

scientific article
Language Label Description Also known as
English
Solving MAX-\(r\)-SAT above a tight lower bound
scientific article

    Statements

    Solving MAX-\(r\)-SAT above a tight lower bound (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2011
    0 references
    0 references
    max SAT
    0 references
    fixed-parameter tractable
    0 references
    above lower bound
    0 references
    kernel
    0 references
    bikernel
    0 references
    0 references