Pages that link to "Item:Q293164"
From MaRDI portal
The following pages link to A simplified NP-complete MAXSAT problem (Q293164):
Displayed 17 items.
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Optimal 2-constraint satisfaction via sum-product algorithms (Q844150) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- Learning hierarchical probabilistic logic programs (Q2071314) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- Directed molecular evolution by machine learning and the influence of nonlinear interactions (Q2193127) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT (Q2424823) (← links)
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
- POPULAR SPANNING TREES (Q5404516) (← links)
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333) (← links)