Nonuniformity is a central concept in computational complexity with powerful connections to circuit and randomness. Nonuniform reductions have been used study the isomorphism conjecture for NP completeness larger classes. We power of nonuniform NP-completeness, obtaining both separations upper bounds vs uniform complessness NP. Under various hypotheses, we obtain following separations: also con...

سبحان الذي يسّر لي امري في تحقيق بعض مسائل مخطوطة كتاب الاصطلام للعلامة ابي المظفر السمعاني، وسهّل عملي اخراج المسائل وتخريج مضامينها اللغوية والفقهية والروائية وفهم ما أراد المؤلف. فقد تناولت اربع (نكاح الشغار، ونكاح المحرم وانكاحه، وفسخ النكاح بالعيوب، وعتق المرأة والخيار). وتناولت التعريف بحياة المؤلف ولم أسهب بترجمه حياته؛ لانه قد سبقني زملائي ممن قاموا بتحقيق الكتاب ولعل الطالب عبد العزيز اف...

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P NP question and the “Deterministic” versus “Non Deterministic” nature of a problem, and more specifically at the temporal nature of the complexity within theNP class of problems. Let us remind that the NP class is called ...

objective: survey of molecular characterization of nucleoprotein gene of h9n2 avian influenza viruses and determination of the genetic relationship of iranian h9n2 viruses and other asian viruses. materials and methods: the nucleoprotein (np) genes from 4 isolates of h9n2 viruses isolated from commercial chickens in iran during 2008-2009 were amplified by rt-pcr method and sequenced. nucleotid...