Gopalan et al. studied in ICALP06 [17] connectivity properties of the solution-space of Boolean formulas, and investigated complexity issues on the connectivity problems in Schaefer’s framework. A set S of logical relations is Schaefer if all relations in S are either bijunctive, Horn, dual Horn, or affine. They conjectured that the connectivity problem for Schaefer is in P . We disprove their ...

Holographic algorithms, alternatively known as Pfaffian circuits, have received a great deal of attention for giving polynomial-time algorithms of #P-hard problems. Much work has been done to determine the extent of what this machinery can do and the expressiveness of these circuits. One aspect of interest is the fact that these circuits must be planar. Work has been done to try and relax the p...

AIMS To evaluate the clinical significance of macular hole closure types assessed by optical coherence tomography (OCT). METHODS This study involved 34 eyes of 32 patients who had undergone anatomically successful idiopathic macular hole surgery. The closed macular holes were categorised into two patterns based on OCT; type 1 closure (closed without foveal neurosensory retinal defect) and typ...

Aim. The authors reviewed their experience in the management of open abdomen using the vacuum-assisted closure (VAC), in order to assess its morbidity, and the outcome of abdominal wall integrity. Methods. A retrospective review was performed using the trauma registry to identify patients undergoing temporary abdominal closure (TAC) either using Bogota Bag (BB) or VAC, from January 2006 to Dece...

For any ordered set P, the join dense completions of P form a complete lattice K(P) with least element O(P), the lattice of order ideals of P, and greatest element M(P), the Dedekind-MacNeille completion of P. The latticeK(P) is isomorphic to an ideal of the lattice of all closure operators on the lattice O(P). Thus it inherits some local structural properties which hold in the lattice of closu...

background: it has been estimated that 67 million people worldwide are affected with a primary glaucoma and that one-third have primary angle closure glaucoma. we aimed to determine the biometric differences between the eyes of patients with acute attack of primary angle closure and their non-involved fellow eyes.   methods: twenty eight patients with acute attack of primary angle closure were ...

Let P P-comp denote the sets that are solvable in polynomial time on average under every polynomial-time computable distribution on the instances. In this paper we show that the truth-table closure of P P-comp has measure 0 in EXP. Since, as we show, EXP is Turing reducible to P P-comp , the Turing closure has measure 1 in EXP and thus, P P-comp is an example of a subclass of E such that the cl...

The study of the complexity of sets encompasses two complementary aims: (1) establishing-usually via explicit construction of algorithms-that sets are feasible, and (2) studying the relative complexity of sets that plausibly might be feasible but are not currently known to be feasible (such as the NP-complete sets and the PSPACE-complete sets ). For the study of the complexity of closure proper...