144 search results - page 3 / 29 » The complexity of Boolean formula minimization |
CC
2010
Springer
13 years 6 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...
COCO
1991
Springer
13 years 11 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
RANDOM
2001
Springer
14 years 1 days ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
INFORMS
2002
13 years 7 months ago
2002
NIPS
2001
13 years 9 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...