6142 search results - page 547 / 1229 » The Complexity of Partition Functions |
189
Voted
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
174
click to vote
ICDT
1995
ACM
15 years 10 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
194
click to vote
NIPS
1993
15 years 8 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
183
click to vote
ENTCS
2007
15 years 7 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
194
click to vote
ECCB
2008
IEEE
16 years 1 months ago
2008
IEEE
Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on u...