Séminaires : Séminaire de Logique Lyon-Paris

Equipe(s) : lm,
Responsables :S. Anscombe, O. Finkel, A. Khélif, S. Rideau, T. Tsankov, A. Vignati
Email des responsables :
Salle : Contacter Silvain Rideau ou Alessandro Vignati
Adresse :

ArchivesRetour ligne automatique
Abonnement à la liste de diffusion

Orateur(s) Miki Hermann - CNRS et LIX, Ecole Polytechnique,
Titre Minimal Distance of Propositional Models
Horaire15:10 à 16:10
RésumeWe investigate the complexity of three optimization problems in Boolean propositional logic related to information theory: Given a conjunctive formula over a set of relations, find a satisfying assignment with minimal Hamming distance to a given assignment that satisfies the formula (NextOtherSol, NOSOL$) or that does not need to satisfy it (NearestSol, NSOL). The third problem asks for two satisfying assignments with a minimal Hamming distance among all such assignments (MinSolDistance, MSD).

For all three problems we give complete classifications with respect to the relations admitted in the formula. We give polynomial time algorithms for several classes of constraint languages. For all other cases we prove hardness or completeness regarding APX, poly-APX, or equivalence to well-known hard optimization problems.
SalleContacter Silvain Rideau ou Alessandro Vignati