1278 search results - page 147 / 256 » The Complexity of Weighted Boolean |
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
COCO
1999
Springer
14 years 2 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
COLT
1999
Springer
14 years 2 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
VLDB
1992
ACM
14 years 2 months ago
1992
ACM
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
CDB
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...