75 search results - page 11 / 15 » On the Monotone Circuit Complexity of Quadratic Boolean Func... |
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
ACSD
2010
IEEE
13 years 5 months ago
2010
IEEE
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
SIAMCOMP
2011
13 years 2 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...