4255 search results - page 72 / 851 » On Learning Boolean Functions |
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
ALGORITHMICA
2010
14 years 10 months ago
2010
Abstract Winfree's pioneering work led the foundations in the area of errorreduction in algorithmic self-assembly (Winfree and Bekbolatov in DNA Based Computers 9, LNCS, vol. ...
DAC
2005
ACM
15 years 10 months ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...
106
click to vote
COLT
1991
Springer
15 years 1 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
COLT
2003
Springer
15 years 3 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...