Credimus

We believe that economic design and computational complexity---while already important to each other---should become even more important to each other with each passing year. But for that to happen, experts in on the one hand such areas as social choice, economics, and political science and on the other hand computational complexity will have to better understand each other's worldviews. This article, written by two complexity theorists who also work in computational social choice theory, focuses on one direction of that process by presenting a brief overview of how most computational complexity theorists view the world. Although our immediate motivation is to make the lens through which complexity theorists see the world be better understood by those in the social sciences, we also feel that even within computer science it is very important for nontheoreticians to understand how theoreticians think, just as it is equally important within computer science for theoreticians to understand how nontheoreticians think

Completeness Results for Parameterized Space Classes

The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy. Several natural parameterized problems have, however, resisted such a classification. At least in some cases, the reason is that upper and lower bounds for their parameterized space complexity have recently been obtained that rule out completeness results for parameterized time classes. In this paper, we make progress in this direction by proving that the associative generability problem and the longest common subsequence problem are complete for parameterized space classes. These classes are defined in terms of different forms of bounded nondeterminism and in terms of simultaneous time--space bounds. As a technical tool we introduce a "union operation" that translates between problems complete for classical complexity classes and for W-classes.Comment: IPEC 201

On the loop-free decomposition of stochastic finite-state systems

Two generalizations of Bacon's theory of loop-free decomposition of probabilistic finite-state systems are proposed. The first of these consists of a modification of the structure of the decomposition which then allows for the decomposition of a larger class of systems. The second generalization subsumes the first: sufficient conditions for a stochastic finite-state system to be decomposable for a single initial distribution on its set of states are given.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/32650/1/0000014.pd

Space Complexity of Stack Automata Models

This paper examines several measures of space complexity on variants of stack automata: non-erasing stack automata and checking stack automata. These measures capture the minimum stack size required to accept any word in a language (weak measure), the maximum stack size used in any accepting computation on any accepted word (accept measure), and the maximum stack size used in any computation (strong measure). We give a detailed characterization of the accept and strong space complexity measures for checking stack automata. Exactly one of three cases can occur: the complexity is either bounded by a constant, behaves (up to small technicalities explained in the paper) like a linear function, or it grows arbitrarily larger than the length of the input word. However, this result does not hold for non-erasing stack automata; we provide an example when the space complexity grows with the square root of the input length. Furthermore, an investigation is done regarding the best complexity of any machine accepting a given language, and on decidability of space complexity properties

Disease burden and economic impact of diagnosed non-alcoholic steatohepatitis (NASH) in the United Kingdom (UK) in 2018

BACKGROUNDS AND AIMS: Non-alcoholic steatohepatitis (NASH) – a progressive subset of non-alcoholic fatty liver disease (NAFLD) – is a chronic liver disease that can progress to advanced fibrosis, cirrhosis, and end-stage liver disease (ESLD) if left untreated. Early-stage NASH is usually asymptomatic, meaning a large proportion of the prevalent population are undiagnosed. Receiving a NASH diagnosis increases the probability that a patient will receive interventions for the purpose of managing their condition. The purpose of this study was to estimate the disease burden and economic impact of diagnosed NASH in the United Kingdom (UK) adult population in 2018. METHODS: The socioeconomic burden of diagnosed NASH from a societal perspective was estimated using cost-of-illness methodology applying a prevalence approach. This involved estimating the number of adults with diagnosed NASH in the UK in a base period (2018) and the economic and wellbeing costs attributable to diagnosed NASH in that period. The analysis was based on a targeted review of the scientific literature, existing databases and consultation with clinical experts, health economists and patient groups. RESULTS: Of the prevalent NASH population in the UK in 2018, an estimated 79.8% were not diagnosed. In particular, of the prevalent population in disease stages F0 to F2, only 2.0% (F0), 2.0% (F1) and 16.5% (F2), respectively, were diagnosed. Total economic costs of diagnosed NASH in the UK ranged from £2.3 billion (lower prevalence scenario, base probability of diagnosis scenario) to £4.2 billion (higher prevalence scenario, base probability of diagnosis scenario). In 2018, people with NASH in the UK were estimated to experience 94,094 to 174,564 disability-adjusted life years (DALYs) overall. Total wellbeing costs associated with NASH in 2018 were estimated to range between £5.6 to £10.5 billion. CONCLUSIONS: The prevention and appropriate management of adult NASH patients could result in reduced economic costs and improvements in wellbeing

Coenzyme A-transferase-independent butyrate re-assimilation in Clostridium acetobutylicum - evidence from a mathematical model

The hetero-dimeric CoA-transferase CtfA/B is believed to be crucial for the metabolic transition from acidogenesis to solventogenesis in Clostridium acetobutylicum as part of the industrial-relevant acetone-butanol-ethanol (ABE) fermentation. Here, the enzyme is assumed to mediate re-assimilation of acetate and butyrate during a pH-induced metabolic shift and to faciliate the first step of acetone formation from acetoacetyl-CoA. However, recent investigations using phosphate-limited continuous cultures have questioned this common dogma. To address the emerging experimental discrepancies, we investigated the mutant strain Cac-ctfA398s::CT using chemostat cultures. As a consequence of this mutation, the cells are unable to express functional ctfA and are thus lacking CoA-transferase activity. A mathematical model of the pH-induced metabolic shift, which was recently developed for the wild type, is used to analyse the observed behaviour of the mutant strain with a focus on re-assimilation activities for the two produced acids. Our theoretical analysis reveals that the ctfA mutant still re-assimilates butyrate, but not acetate. Based upon this finding, we conclude that C. acetobutylicum possesses a CoA-tranferase-independent butyrate uptake mechanism that is activated by decreasing pH levels. Furthermore, we observe that butanol formation is not inhibited under our experimental conditions, as suggested by previous batch culture experiments. In concordance with recent batch experiments, acetone formation is abolished in chemostat cultures using the ctfa mutant