Bookmark Saya

Semantic Scholar Open Access 2007 190 sitasi

Random constraint satisfaction: Easy generation of hard (satisfiable) instances

Ke Xu F. Boussemart Fred Hemery Christophe Lecoutre
Lihat Sumber DOI

Topik & Kata Kunci

Computer Science Mathematics

Penulis (4)

K

Ke Xu

F

F. Boussemart

F

Fred Hemery

C

Christophe Lecoutre

Format Sitasi

APA MLA BibTeX
Xu, K., Boussemart, F., Hemery, F., Lecoutre, C. (2007). Random constraint satisfaction: Easy generation of hard (satisfiable) instances. https://doi.org/10.1016/j.artint.2007.04.001

Akses Cepat

Lihat di Sumber doi.org/10.1016/j.artint.2007.04.001
Informasi Jurnal
Tahun Terbit
2007
Bahasa
en
Total Sitasi
190×
Sumber Database
Semantic Scholar
DOI
10.1016/j.artint.2007.04.001
Akses
Open Access ✓