4255 search results - page 64 / 851 » On Learning Boolean Functions |
APAL
2004
14 years 11 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
103
click to vote
PODS
2000
ACM
15 years 4 months ago
2000
ACM
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
102
click to vote
JAR
2011
14 years 6 months ago
2011
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
FMCAD
2006
Springer
15 years 3 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
FPGA
2007
ACM
15 years 6 months ago
2007
ACM
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...