We show that there is a polynomial space algorithm that counts the number of perfect matchings in an n-vertex graph in O*(2n/2) ⊂ O(1.415n) time. (O*(f(n)) suppresses functions polylogarithmic in f(n)). The previously fastest algorithms for the problem was the exponential space O*(((1 + √5)/2)n) ⊂ O(1.619n) time algorithm by Koivisto, and for polynomial space, the O(1.942n) time algorithm by Neder

This article briefly reviews the recent discussion on how to use different versions of the concentration index to measure socioeconomic health inequalities; the appropriateness of the different versions depends on the measurement properties of the health variable and the intended value judgment. Using the European Survey of Health, Ageing and Retirement, the article also empirically illustrates th

Intervju av Neal Ashley Conrad Thing med Anders Mortensen om dennes forskning om Gunnar Ekelöf

According to, for instance Severin Sorensen, the home security market (consumer market) as well as the Small businesses market has not really taken of and there has been debate as to why this is. Many seem to view the market with small businesses, as well as the regular consumer business, as something that requires too much sales time, too much support time and too little overall gains to be worth

Abstract is not available

All randomized controlled studies published in international peer-reviewed journals up to July 1999 were meta-analysed with the aim of studying the effect of psychosocial interventions on patients with drug dependence. Systematic literature searches were administered by SBU. In all 104 studies were screened and rated according to the 12 dimension quality score of SBU. The analyses in the chapter s

The paper considers period overruns in control tasks with variationsin execution time (or response time). A simple model is used, wherethe input and output operations are assumed to be time-triggered,and the execution-time distribution of the task is assumed to beknown. Three overrun strategies, called Abort, Skip, andQueue, are modeled as discrete-time jump linear systems and areanalyzed with reg

A fully integrated digital PLL used as a clock multiplying circuit is designed and manufactured. The PLL has no off-chip components and it is made from standard cells found in most digital standard cell libraries. It is therefore portable between processes as an IP-block. Using a 0.35 μm standard CMOS process and a 3.0 V supply voltage, the PLL has a frequency range of 152 MHz to 366 MHz and occup

Philosophers of science have often favoured reductive approaches to how-possibly explanation. This article identifies three alternative conceptions making how-possibly explanation an interesting phenomenon in its own right. The first variety approaches “how possibly X?” by showing that X is not epistemically impossible. This can sometimes be achieved by removing misunderstandings concerning the