6142 search results - page 207 / 1229 » The Complexity of Partition Functions |
119
Voted
CORR
2006
Springer
15 years 3 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...
123
Voted
CORR
2004
Springer
15 years 3 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...
134
Voted
ICALP
2007
Springer
15 years 9 months 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...
127
Voted
IJCNN
2006
IEEE
15 years 9 months 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...
121
Voted
ICALP
2005
Springer
15 years 9 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...