1242 search results - page 120 / 249 » A Computational Complexity Theory in Membrane Computing |
195
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
198
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
171
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
154
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
163
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...