6142 search results - page 207 / 1229 » The Complexity of Partition Functions |
145
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
169
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
177
click to vote
ICALP
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
172
click to vote
IJCNN
2006
IEEE
16 years 15 days ago
2006
IEEE
— Inspired by the universal laws governing different kinds of complex networks, we propose a scale-free highlyclustered echo state network (SHESN). Different from echo state netw...
154
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...