4255 search results - page 73 / 851 » On Learning Boolean Functions |
DAC
2003
ACM
15 years 10 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
ISMVL
1997
IEEE
15 years 2 months ago
1997
IEEE
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider boolean circuits computing n-operators f : {0, 1}n {0, 1}n . As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operat...
102
click to vote
CRYPTO
1990
Springer
15 years 1 months ago
1990
Springer
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
AML
2008
14 years 10 months ago
2008
We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theorie...