Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.05.040 / rank
Normal rank
 
Property / author
 
Property / author: Hong Liu / rank
Normal rank
 
Property / author
 
Property / author: Hong Liu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6680874 / rank
 
Normal rank
Property / zbMATH Keywords
 
local search
Property / zbMATH Keywords: local search / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
performance ratio
Property / zbMATH Keywords: performance ratio / rank
 
Normal rank
Property / zbMATH Keywords
 
satisfiability
Property / zbMATH Keywords: satisfiability / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Outward rotations / rank
 
Normal rank
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.tcs.2016.05.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2415155455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bound on Johnson's algorithm for maximum satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for max set splitting and max NAE SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm based on tabu search for satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Syntactic versus Computational Views of Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search characteristics of incomplete SAT procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.05.040 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:46, 9 December 2024

scientific article
Language Label Description Also known as
English
Approximating Max NAE-\(k\)-SAT by anonymous local search
scientific article

    Statements

    Approximating Max NAE-\(k\)-SAT by anonymous local search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 February 2017
    0 references
    local search
    0 references
    algorithm
    0 references
    complexity
    0 references
    performance ratio
    0 references
    satisfiability
    0 references

    Identifiers