JOURNAL ARTICLE

Approximating Max NAE-k-SAT by anonymous local search

Aiyong XianKaiyuan ZhuDaming ZhuLianrong PuHong Liu

Year: 2016 Journal:   Theoretical Computer Science Vol: 657 Pages: 54-63   Publisher: Elsevier BV
Keywords:
Combinatorics Mathematics Computer science Algorithm Discrete mathematics

Metrics

1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
42
Refs
0.05
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Constraint Satisfaction and Optimization
Physical Sciences →  Computer Science →  Computer Networks and Communications
Logic, Reasoning, and Knowledge
Physical Sciences →  Computer Science →  Artificial Intelligence
Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

BOOK-CHAPTER

Local Search to Approximate Max NAE-$$k$$-Sat Tightly

Aiyong XianKaiyuan ZhuDaming ZhuLianrong Pu

Lecture notes in computer science Year: 2015 Pages: 271-281
BOOK-CHAPTER

Approximating MIN k-SAT

Adi AvidorUri Zwick

Lecture notes in computer science Year: 2002 Pages: 465-475
JOURNAL ARTICLE

Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem

David GamarnikMadhu Sudan

Journal:   SIAM Journal on Computing Year: 2017 Vol: 46 (2)Pages: 590-619
JOURNAL ARTICLE

The phase transition in 1-in-k SAT and NAE 3-SAT

Dimitris AchlioptasArthur D. ChtcherbaGabriel IstrateCristopher Moore

Journal:   Symposium on Discrete Algorithms Year: 2001 Pages: 721-722
JOURNAL ARTICLE

Analysis of Local Search Landscapes for k-SAT Instances

Andreas AlbrechtPeter C. R. LaneKathleen Steinhöfel

Journal:   Mathematics in Computer Science Year: 2010 Vol: 3 (4)Pages: 465-488
© 2026 ScienceGate Book Chapters — All rights reserved.