Image de couverture de livre

A Reply to "On Salum's Algorithm for X3SAT"

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Salum, Latif
Format:	Preprint
Publié:	2021
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
par: DeJesse, Nicholas, et autres
Publié: (2025)

A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
par: He, Yumeng, et autres
Publié: (2024)

A Polynomial Time Algorithm for 3SAT
par: Quigley, Robert
Publié: (2024)

A Graphical #SAT Algorithm for Formulae with Small Clause Density
par: Laakkonen, Tuomas, et autres
Publié: (2022)

An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
par: Alasli, M.
Publié: (2025)

Linear Planar 3-SAT and Its Applications in Planning
par: Desbois, Victorien, et autres
Publié: (2025)

An even simpler hard variant of Not-All-Equal 3-SAT
par: Darmann, Andreas, et autres
Publié: (2024)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)

Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard
par: Krokhin, Andrei, et autres
Publié: (2025)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
par: Austrin, Per, et autres
Publié: (2024)

Local Quantum Search Algorithm for Random $k$-SAT with $Ω(n^{1+ε})$ Clauses
par: Wu, Mingyou
Publié: (2024)

Geometric Interpretation of 3-SAT and Phase Transition
par: Gillet, Frederic
Publié: (2025)

A Hypergraph Container Method on Spread SAT: Approximation and Speedup
par: Han, Zicheng, et autres
Publié: (2026)

Approximately counting maximal independent set is equivalent to #SAT
par: Zhang, Hao, et autres
Publié: (2024)

Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity
par: Zhan, Yongjian
Publié: (2026)

Ruling Out Low-rank Matrix Multiplication Tensor Decompositions with Symmetries via SAT
par: Yang, Jason
Publié: (2024)

On the Mysteries of MAX NAE-SAT
par: Brakensiek, Joshua, et autres
Publié: (2020)

Quantum k-SAT Related Hypergraph Problems
par: Kremer, Simon-Luca, et autres
Publié: (2025)

A Note On The Natural Range Of Unambiguous-SAT
par: Pay, Tayfun
Publié: (2023)

On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses
par: Caragiannis, Ioannis, et autres
Publié: (2024)

Further Explanations on "SAT Requires Exhaustive Search"
par: Dong, Qingxiu, et autres
Publié: (2024)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
par: Krebs, Andreas, et autres
Publié: (2025)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
par: Cardoso, Ricardo Rivera, et autres
Publié: (2025)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
par: Li, Zhengyu, et autres
Publié: (2023)

A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization
par: Schreiber, Franz J., et autres
Publié: (2025)

SAT, Gadgets, Max2XOR, and Quantum Annealers
par: Ansótegui, Carlos, et autres
Publié: (2024)

Have Large Language Models Learned to Reason? A Characterization via 3-SAT Phase Transition
par: Hazra, Rishi, et autres
Publié: (2025)

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
par: Nishiyama, Yumiko
Publié: (2025)

SAT problem and Limit of Solomonoff's inductive reasoning theory
par: Pan, Feng
Publié: (2025)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
par: Bedert, Benjamin, et autres
Publié: (2025)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
par: Rudolph, Dorian, et autres
Publié: (2024)

Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
par: Hirahara, Shuichi, et autres
Publié: (2025)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
par: Gamarnik, David, et autres
Publié: (2023)

Search-Driven Clause Learning for Product-State Quantum $k$-SAT (PRODSAT-QSAT)
par: González-Castillo, Samuel, et autres
Publié: (2026)

On SAT information content, its polynomial-time solvability and fixed code algorithms
par: Drozdowski, Maciej
Publié: (2024)

PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
par: Scheder, Dominik, et autres
Publié: (2025)

Optimal Polynomial-Time Estimators: A Bayesian Notion of Approximation Algorithm
par: Kosoy, Vanessa, et autres
Publié: (2016)

P-time Algorithms for Typical #EO Problems
par: Meng, Boning, et autres
Publié: (2024)

An Efficient Algorithm for Solving the 2-MAXSAT Problem
par: Chen, Yangjun
Publié: (2023)

SAT Requires Exhaustive Search
par: Xu, Ke, et autres
Publié: (2023)