Ke Xu's Benchmarks for Hard Problems
Library Home || Full Table of Contents || Suggest a Link || Library Help
|All benchmarks are generated based on exact phase transitions of Model RB, including forced satisfiable benchmarks of SAT/CSP and benchmarks with hidden optimum solutions for 0-1 Programming and graph problems (Independent Set, Vertex Cover, Clique and Vertex Coloring).|
|Resource Types:||Net-Based Resources|
|Math Topics:||Discrete Math, Optimization, Computer Science|
© 1994- The Math Forum at NCTM. All rights reserved.