We consider the analog of the P versus NP∩ co-NP question for the classical two-party communication protocols where polynomial time is replaced by poly-logarithmic communication: if both a boolean function f and its negation ¬f have small (poly-logarithmic in the number of variables) nondeterministic communication complexity, what is then its deterministic and/or probabilistic communication com...

BACKGROUND Treating symptoms and preventing exacerbations are key components of chronic obstructive pulmonary disease (COPD) long-term management. Recently, a more tailored treatment approach has been proposed, in particular for two well-established clinical phenotypes, frequent exacerbators and chronic bronchitis-dominant COPD. ELOM-080 has demonstrated clinical efficacy in treating symptoms a...

PURPOSE The aim of this study was to investigate the stress distribution of 2-short implants (2SIs) installed in a severely atrophic maxillary molar site. MATERIALS AND METHODS Three different diameters of internal connection implants were modeled: narrow platform (NP), regular platform (RP), and wide platform (WP). The maxillary first molars were restored with one implant or two short implan...

Diabetes mellitus is an important risk factor for the development of heart pathology. Myocardial infarction is the cause of death occurring after prolonged ischemia of the coronary arteries. Restoration of blood flow is the first intervention against heart attack, although the process of restoring blood flow to the ischemic myocardium could cause additional injury. This phenomenon, termed myoca...

In the number-on-forehead (NOF) model of communication complexity, k players are trying to evaluate a function F defined on kn bits. The input of F is partitioned into k pieces of n bits each, call them x1, . . . ,xk, and xi is placed, metaphorically, on the forehead of player i. Thus, each player sees (k − 1)n of the kn input bits. The players communicate by writing bits on a shared blackboard...

An oracle machine is called monotonous, if after a negative answer the machine does not ask further queries to the oracle. For example, one truth-table, conjunctive, and Hausdorr reducibilities are monotonous. We study the consequences of the existence of sparse hard sets for diierent complexity classes under monotonous and randomized reductions. We prove trade-oos between the randomized time c...

We consider autoreducibility of complete sets for the two common types of probabilistic polynomial-time reductions: RP reductions containing one-sided errors on positive input instances only, and BPP reductions containing two-sided errors. Specifically, we focus on the probabilistic counterparts of the deterministic many-one and truthtable autoreductions. We prove that non-trivial complete sets...

This study was established to report the yield production (fresh bunches) of oil palm (Elaeis guineensis Jacq.) material planting Resistance Plant (RP) and Non-Resistance (NP) Ganoderma on experimental plantation. The data observed conduct in from zero (0) until twenty-five (25) years. In 5 years, firstly pathogen recorded start low both materials planting. involved a highest RP 581,163 FFB/ha ...

RY-080 (ethyl 8-ethynyl-5,6-dihydro-5-methyl-6-oxo-4H-imidazo[1,5-a][1,4]benzodiazepine-3-carboxylate) is an imidazobenzodiazepine with 40–50-fold higher affinity for the benzodiazepine binding site of α5rather than α1-, α2or α3-containing GABAA receptors. Previous data describing RY-080 as being convulsant suggests that inverse agonists selective for the α5 subtype may not be suitable for clin...

In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic randomized and nondeterministic reductions We show that if an NP complete set is bounded truth table reducible to some set that conjunctively reduces to a sparse set then P NP This result subsumes and extends previously known results yielding a co...