Approximating Succinct MaxSat

DOI10.1093/LOGCOM/EXI033zbMath1104.68052OpenAlexW1968293687MaRDI QIDQ5696308

Luca Trevisan, Christian Schallhart

Publication date: 18 October 2005

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exi033

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: Approximating Succinct MaxSat