380 search results - page 74 / 76 » A Categorical Setting for Lower Complexity |
COCO
2010
Springer
15 years 3 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
FOCS
2007
IEEE
15 years 3 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...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
112
click to vote
ASPLOS
2008
ACM
15 years 1 months ago
2008
ACM
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
ICSE
2010
IEEE-ACM
15 years 1 months ago
2010
IEEE-ACM
Many computations exhibit a trade off between execution time and quality of service. A video encoder, for example, can often encode frames more quickly if it is given the freedom ...