206 search results - page 5 / 42 » On the numbers of variables to represent sparse logic functi... |
CAV
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...
COCOS
2003
Springer
14 years 21 days ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
CAP
2010
13 years 2 months ago
2010
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
NIPS
2001
13 years 8 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...