A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2013.08.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145759487 / 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: Solving MAX-\(r\)-SAT above a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / 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: Parameterized complexity of MaxSat 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: Q4393480 / 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: Parametrized complexity theory. / 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: Parameterizing above Guaranteed Values: MaxSat and MaxCut / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:30, 7 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
    0 references
    0 references
    16 January 2014
    0 references
    MaxSat
    0 references
    3-satisfiability
    0 references
    fixed-parameter tractable
    0 references
    kernel
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers