Practically uniform solution sampling in constraint programming

DOI10.1007/978-3-031-08011-1_22zbMath1502.68278OpenAlexW4285308427MaRDI QIDQ2170209

Hélène Verhaeghe, Claude-Guy Quimper, Gilles Pesant

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_22

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• On the usefulness of linear modular arithmetic in constraint programming

This page was built for publication: Practically uniform solution sampling in constraint programming