503 search results - page 76 / 101 » Interpolative Boolean Logic |
TCAD
2008
14 years 9 months ago
2008
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
81
Voted
JSYML
2007
14 years 9 months ago
2007
The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to b...
SIAMCOMP
2000
14 years 9 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
126
click to vote
CC
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
JLP
2010
14 years 4 months ago
2010
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...