A study of the outcome of pregnancy complicated by obstetric cholestasis

Background: Obstetric cholestasis is one of the most common causes of liver disease in pregnancy. Present study was carried out to study the incidence of Obstetric Cholestasis and its feto-maternal outcome in a tertiary care hospital.Methods: It is a prospective epidemiologycal study during a period of one year (2014 to 2015) over 100 pregnant ladies suffering from pruritus and detected as having Obstetric Cholestasis. They were followed up and maternal as well as fetal-neonatal outcome recorded. Appropriate statistical analysis done as applicable.Results: The incidence of Obstetric Cholestasis in our hospital was 9.9%. Majority of cases (43.0%) are diagnosed in late gestational age, mostly during 28 to 32 weeks period of gestation. Maternal morbidities are due to sleep disturbance (60/100), dyslipidemia, coagulation abnormality, PPH (10.0%) and increase chance of operative delivery (66.0%). Neonatal morbidities are mainly due to fetal distress, prematurity (22.0%), low birth weight (32/100) and meconium staining of amniotic fluid (42.0%). Maximum number of patients are delivered at 37 to 38 weeks, due to active and early intervention.Conclusions: Early diagnosis and active maternal and fetal surveillance is of utmost importance to avoid adverse outcomes

Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy

It is known [BHZ87] that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. [LFKN92] have shown that #SAT, the #P-complete function that outputs the number of satisfying assignments of a Boolean for-mula, can be computed by a linear-round interactive protocol. As a consequence, the coNP-complete set SAT has a proof system with linear rounds of interaction. We show that if every set in coNP has a polylogarithmic-round interactive protocol then the expo-nential hierarchy collapses to the third level. In order to prove this, we obtain an exponential version of Yap’s result [Yap83], and improve upon an exponential version of the Karp-Lipton theorem [KL80], obtained first by Buhrman and Homer [BH92]

A study of the outcome of pregnancy complicated by obstetric cholestasis

Background: Obstetric cholestasis is one of the most common causes of liver disease in pregnancy. Present study was carried out to study the incidence of Obstetric Cholestasis and its feto-maternal outcome in a tertiary care hospital.Methods: It is a prospective epidemiologycal study during a period of one year (2014 to 2015) over 100 pregnant ladies suffering from pruritus and detected as having Obstetric Cholestasis. They were followed up and maternal as well as fetal-neonatal outcome recorded. Appropriate statistical analysis done as applicable.Results: The incidence of Obstetric Cholestasis in our hospital was 9.9%. Majority of cases (43.0%) are diagnosed in late gestational age, mostly during 28 to 32 weeks period of gestation. Maternal morbidities are due to sleep disturbance (60/100), dyslipidemia, coagulation abnormality, PPH (10.0%) and increase chance of operative delivery (66.0%). Neonatal morbidities are mainly due to fetal distress, prematurity (22.0%), low birth weight (32/100) and meconium staining of amniotic fluid (42.0%). Maximum number of patients are delivered at 37 to 38 weeks, due to active and early intervention.Conclusions: Early diagnosis and active maternal and fetal surveillance is of utmost importance to avoid adverse outcomes

Reductions between disjoint NP-pairs

We prove that all of the following assertions are equivalent: There is a many-one complete disjoint NP-pair; there is a strongly many-one complete disjoint NP-pair; there is a Turing com-plete disjoint NP-pair such that all reductions are smart reductions; there is a complete disjoint NP-pair for one-to-one, invertible reductions; the class of all disjoint NP-pairs is uniformly enumerable. Let A, B, C, and D be nonempty sets belonging to NP. A smart reduction between the disjoint NP-pairs (A, B) and (C, D) is a Turing reduction with the additional property that if the input belongs to A ∪ B, then all queries belong to C ∪ D. We prove under the reasonable assumption UP ∩ co-UP has a P-bi-immune set that there exist disjoint NP-pairs (A, B) and (C, D) such that (A, B) is truth-table reducible to (C, D), but there is no smart reduction be-tween them. This paper contains several additional separations of reductions between disjoint NP-pairs. We exhibit an oracle relative to which DisjNP has a truth-table-complete disjoint NP-pair, but has no many-one-complete disjoint NP-pair

Reductions between disjoint NP-pairs

We prove that all of the following assertions are equivalent: There is a many-one complete disjoint NP-pair; there is a strongly many-one complete disjoint NP-pair; there is a Turing complete disjoint NP-pair such that all reductions are smart reductions; there is a complete disjoint NP-pair for one-to-one, invertible reductions; the class of all disjoint NP-pairs is uniformly enumerable. Let A, B, C, and D be nonempty sets belonging to NP. A smart reduction between the disjoint NP-pairs (A, B) and (C, D) is a Turing reduction with the additional property that if the input belongs to A ∪ B, then all queries belong to C ∪ D. We prove under the reasonable assumption UP ∩ co-UP has a P-bi-immune set that there exist disjoint NP-pairs (A, B) and (C, D) such that (A, B) is truth-table reducible to (C, D), but there is no smart reduction between them. This paper contains several additional separations of reductions between disjoint NP-pairs. We exhibit an oracle relative to which DisjNP has a truth-table-complete disjoint NP-pair, but has no many-one-complete disjoint NP-pair

Disjoint NP-Pairs

We study the question of whether the class DisNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provides additional evidence for the existence of P-inseparable disjoint NP-pairs. We construc