6142 search results - page 177 / 1229 » The Complexity of Partition Functions |
119
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
134
click to vote
ACMICEC
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
137
Voted
EUROCRYPT
2010
Springer
15 years 8 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
121
Voted
FM
2009
Springer
15 years 10 months ago
2009
Springer
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
145
Voted
BCB
2010
14 years 10 months ago
2010
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...