A Computational Study of DP with Symmetry on Hard Satisfiability Problems - Université d'Artois Accéder directement au contenu
Communication Dans Un Congrès Année : 1994

A Computational Study of DP with Symmetry on Hard Satisfiability Problems

Lakhdar Saïs
Fichier non déposé

Dates et versions

hal-03301147 , version 1 (27-07-2021)

Identifiants

  • HAL Id : hal-03301147 , version 1

Citer

Lakhdar Saïs. A Computational Study of DP with Symmetry on Hard Satisfiability Problems. Proceedings of the AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods, 1994, Seattle, USA, Unknown Region. pp.52-56. ⟨hal-03301147⟩
5 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More