1552 search results - page 51 / 311 » On the Complexity of Constant Propagation |
103
click to vote
CCIA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
JSYML
2006
15 years 1 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
100
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
110
click to vote
STACS
2001
Springer
15 years 6 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...