129 search results - page 5 / 26 » Lower Bounds for Testing Triangle-freeness in Boolean Functi... |
68
Voted
ASIACRYPT
2000
Springer
15 years 1 months ago
2000
Springer
We establish, for the first time, an explicit and simple lower bound on the nonlinearity Nf of a Boolean function f of n variables satisfying the avalanche criterion of degree p, ...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
86
Voted
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
COCO
1991
Springer
15 years 1 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...
77
Voted
ERSHOV
2003
Springer
15 years 2 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.