Now showing items 1-2 of 2
Solving Hybrid Boolean Constraints by Fourier Expansions and Continuous Optimization
The Boolean SATisfiability problem (SAT) is of central importance in computer science. Although SAT is known to be NP-complete, progress on the engineering side---especially that of Conflict-Driven Clause Learning (CDCL) ...
FPRAS Approximation of the Matrix Permanent in Practice
The matrix permanent belongs to the complexity class #P-Complete. It is gener- ally believed to be computationally infeasible for large problem sizes, and significant research has been done on approximation algorithms for ...