works on
2-sat 1algorithm design 1complexity theory 1graph representation 1maxsat 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

cs.CC2026

Solving 2-MAXSAT in Polynomial Time: a Proof of =

Yangjun Chen

The paper proposes a polynomial‑time algorithm for the NP‑complete 2‑MAXSAT problem by converting it to a DNF maximization task and using graph‑based (p*-graph) and trie‑like struc…