scientific article; zbMATH DE number 6469162
From MaRDI portal
zbMath1317.68077MaRDI QIDQ5501275
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
A new bound for 3-satisfiable MaxSat and its algorithmic application, Partial Satisfaction of k-Satisfiable Formulas, A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications, A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application