707 search results - page 101 / 142 » The Nonhomomorphicity of Boolean Functions |
COCO
1997
Springer
14 years 8 days ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
ICCAD
1993
IEEE
14 years 7 days ago
1993
IEEE
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
IJCAI
1993
13 years 9 months ago
1993
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
TCS
2008
13 years 8 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...