1278 search results - page 20 / 256 » The Complexity of Weighted Boolean |
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...
INDOCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
DAM
2008
13 years 7 months ago
2008
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
AUSDM
2006
Springer
13 years 11 months ago
2006
Springer
Supervised text classification is the task of automatically assigning a category label to a previously unlabeled text document. We start with a collection of pre-labeled examples ...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...