Search

Abstract: The present paper explores the notion that an important difference between prior operational definitions of “cue” or “heuristic” information versus “message argument” information has to do with differential processing difficulty, and relative ordinal position of these two information types. In previous work, “cue/heuristic” information typically differed from “message argument” information not only in its contents, but also in it being (1) briefer, and (2) presented prior to the message information. We find that it is relative brevity and ordinal position rather than contents that ultimately explain the differences in persuasive impact between “cue/heuristic” versus “message argument” information. In so far as both “cues” and “message arguments” can vary in brevity and order with which they are presented, these findings are consistent with the view that these two information types do not necessarily differ in their persuasive impact. [Copyright &y& Elsevier]

In this paper we investigate the following question: if NP is slightly hard on average, is it very hard on average? We give a positive answer: if there is a function in NP which is infinitely often balanced and (1-1/poly(n))-hard for circuits of polynomial size, then there is a function in NP which is infinitely often (1/2+n-1/2+#x03B5;)-hard for circuits of polynomial size. Our proof technique is to generalize the Yao XOR Lemma, allowing us to characterize nearly tightly the hardness of a composite function g( f(x1),…,f(xn)) in terms of: (i) the original hardness of f, and (ii) the expected bias of the function g when subjected to random restrictions. The computational result we prove essentially matches an information-theoretic bound. [Copyright &y& Elsevier]