13376 search results - page 165 / 2676 » Problem Solving with |
122
click to vote
EUROCRYPT
2000
Springer
15 years 6 months ago
2000
Springer
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
114
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
121
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
143
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. The inhomogeneous Poisson (Laplace) equation with internal Dirichlet boundary conditions has recently appeared in several applications ranging from image segmentation [1,...
124
click to vote
ICCAD
2008
IEEE
16 years 4 days ago
2008
IEEE
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...