This paper investigates the instance complexities of problems that are hard or weakly hard for exponential time under polynomial time many one reductions It is shown that almost every instance of almost every problem in exponential time has essentially maximal instance complexity It follows that every weakly hard problem has a dense set of such maximally hard instances This extends the theorem ...

We study Abusch’s (2002; 2010) distinction between hard and soft triggers from an experimental point of view. We show that there are apparent counterexamples to the distinction, discuss their status and describe future experiments aiming at clarifying the processing issues that form the core of the problem.

sandwich panels as composite materials have two external walls of either metallic or polymer type. the space between these walls is filled by hard foam or other materials and the thickness of different layers is based on the final application of the panel. in the present work, the extent of variation in core density of polyether urethane foam and subsequent flexural and compressive changes in s...