Recommendations
sgen1: A generator of small but difficult satisfiability benchmarks
The satisfiability problem is known to be NP-Complete; therefore, there should be relatively small problem instances that take a very long time to solve. However, most of the smaller benchmarks that were once thought challenging, especially the ...
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
A solution to a binary constraint satisfaction problem is a set of discrete values, one in each of a given set of domains, subject to constraints that allow only prescribed pairs of values in specified pairs of domains. Solutions are sought by backtrack ...
Redesigning the string hash table, burst trie, and BST to exploit cache
A key decision when developing in-memory computing applications is choice of a mechanism to store and retrieve strings. The most efficient current data structures for this task are the hash table with move-to-front chains and the burst trie, both of ...
Comments