A Computational Study of DP with Symmetry on Hard Satisfiability Problems - Université d'Artois Access content directly
Conference Papers Year : 1994

A Computational Study of DP with Symmetry on Hard Satisfiability Problems

Lakhdar Saïs
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-03301147 , version 1

Cite

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 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More