129 search results - page 3 / 26 » Lower Bounds for Testing Triangle-freeness in Boolean Functi... |
COLT
2008
Springer
13 years 7 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
ACISP
1997
Springer
13 years 10 months ago
1997
Springer
Abstract. Highly nonlinear Boolean functions occupy an important position in the design of secure block as well as stream ciphers. This paper proves two new lower bounds on the non...
DATE
2005
IEEE
13 years 11 months ago
2005
IEEE
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), ...
CC
2010
Springer
13 years 4 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...
DCC
2006
IEEE
14 years 5 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...