scientific article; zbMATH DE number 1302170
From MaRDI portal
Publication:4247437
zbMath0926.90079MaRDI QIDQ4247437
Roberto Battiti, Marco Protasi
Publication date: 11 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Improved exact algorithms for MAX-SAT ⋮ A nonmonotone GRASP ⋮ Unnamed Item ⋮ Differential approximation of MIN SAT, MAX SAT and related problems ⋮ Approximating minimal unsatisfiable subformulae by means of adaptive core search ⋮ Worst-case study of local search for MAX-\(k\)-SAT. ⋮ Approximating MAX SAT by moderately exponential and parameterized algorithms ⋮ Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery ⋮ On exact selection of minimally unsatisfiable subformulae ⋮ Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? ⋮ Solving weighted MAX-SAT via global equilibrium search ⋮ Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
Uses Software
This page was built for publication:
