220 search results - page 35 / 44 » New degree bounds for polynomial threshold functions |
FOCS
1989
IEEE
13 years 11 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
JOC
2000
13 years 7 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
BMCBI
2008
13 years 7 months ago
2008
Background: MLPA method is a potentially useful semi-quantitative method to detect copy number alterations in targeted regions. In this paper, we propose a method for the normaliz...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...