Abstract Based on new data, we replicate Mahajan et al.’s (1990) paper adopter categories and Goldenberg (2002) saddles offer explanations extensions. We use a dataset to the results, namely, U.S. Consumer Technology Association’s Sales & Forecasts, which provides longitudinal data numerous consumer electronic products. Goldenberg, Libai, Muller utilized same source for 1999, while updated ...

Definition 1 ETH: there is no 2 time algorithm for n variable 3-SAT. (the current best bound is 1.30704 [1]). Note that an n-variable 3-SAT can have Ω(n) clauses but Impagliazzo et al. [2] show that there is a 2-time algorithm for n-variable 3-SAT iff there is a 2-time algorithm for m-clause 3-SAT. Thus ETH also says: There is no 2-time algorithm for m-clause 3-SAT. The standard textbook NP-har...