Log in

Relevant bibliographies by topics / P versus NP problem / Journal articles

To see the other types of publications on this topic, follow the link: P versus NP problem.

Journal articles on the topic 'P versus NP problem'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'P versus NP problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

CALUDE, CRISTIAN S., ELENA CALUDE, and MELISSA S. QUEEN. "INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM." Parallel Processing Letters 23, no. 01 (2013): 1350007. http://dx.doi.org/10.1142/s0129626413500072.

Full text

Abstract:

This paper does not propose a solution, not even a new possible attack, to the P versus NP problem. We are asking the simpler question: How “complex” is the P versus NP problem? Using the inductive complexity measure—a measure based on computations run by inductive register machines of various orders—developed in [2], we determine an upper bound on the inductive complexity of second order of the P versus NP problem. From this point of view, the P versus NP problem is significantly more complex than the Riemann hypothesis. To date, the P versus NP problem and the Goostein theorem (which is unpr

APA, Harvard, Vancouver, ISO, and other styles

2

Ruiz-Vanoye, Jorge A., Ocotlán Díaz-Parra, Francisco Rafael Trejo-Macotela, and Julio Cesar Ramos-Fernández. "Editorial: P versus NP problem from Formal Languages Theory View." International Journal of Combinatorial Optimization Problems and Informatics 12, no. 1 (2020): 1–8. https://doi.org/10.61467/2007.1558.2021.v12i1.207.

Full text

Abstract:

P versus NP is an unsolved problem in mathematics and computational complexity. In this paper, we use the formal language theory to the computational complexity to analyze P versus NP problem from a new point of view. P versus NP problem is to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial time. Then, we use the theory of formal languages to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial

APA, Harvard, Vancouver, ISO, and other styles

3

Fortnow, Lance. "The status of the P versus NP problem." Communications of the ACM 52, no. 9 (2009): 78–86. http://dx.doi.org/10.1145/1562164.1562186.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Meester, R. W. J., and K. Slooten. "DNA database matches: A p versus np problem." Forensic Science International: Genetics 46 (May 2020): 102229. http://dx.doi.org/10.1016/j.fsigen.2019.102229.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Pérez-Jiménez, Mario J. "The P versus NP Problem from the Membrane Computing View." European Review 22, no. 1 (2014): 18–33. http://dx.doi.org/10.1017/s1062798713000598.

Full text

Abstract:

In the last few decades several computing models using powerful tools from Nature have been developed (because of this, they are known as bio-inspired models). Commonly, the space-time trade-off method is used to develop efficient solutions to computationally hard problems. According to this, implementation of such models (in biological, electronic, or any other substrate) would provide a significant advance in the practical resolution of hard problems. Membrane Computing is a young branch of Natural Computing initiated by Gh. Păun at the end of 1998. It is inspired by the structure and functi

APA, Harvard, Vancouver, ISO, and other styles

6

Kumar, Neelam Jeevan. "Algorithm for P versus NP Problem on Sets by JEEVAN – KUSHALAIAH Method." International Journal of Computer Applications Technology and Research 2, no. 5 (2013): 526–29. http://dx.doi.org/10.7753/ijcatr0205.1005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Orellana-Martín, David, Luis Valencia-Cabrera, Bosheng Song, Linqiang Pan, and Mario J. Pérez-Jiménez. "Tuning Frontiers of Efficiency in Tissue P Systems with Evolutional Communication Rules." Complexity 2021 (April 28, 2021): 1–14. http://dx.doi.org/10.1155/2021/7120840.

Full text

Abstract:

Over the last few years, a new methodology to address the P versus NP problem has been developed, based on searching for borderlines between the nonefficiency of computing models (only problems in class P can be solved in polynomial time) and the presumed efficiency (ability to solve NP-complete problems in polynomial time). These borderlines can be seen as frontiers of efficiency, which are crucial in this methodology. “Translating,” in some sense, an efficient solution in a presumably efficient model to an efficient solution in a nonefficient model would give an affirmative answer to problem

APA, Harvard, Vancouver, ISO, and other styles

8

Birget, J. C. "Polynomial-time right-ideal morphisms and congruences." International Journal of Algebra and Computation 28, no. 05 (2018): 791–835. http://dx.doi.org/10.1142/s0218196718500364.

Full text

Abstract:

We continue with the functional approach to the P -versus- NP problem, begun in [J. C. Birget, Semigroups and one-way functions, Int. J. Algebra Comput. 25(1–2) (2015) 3–36; J. C. Birget, Infinitely generated semigroups and polynomial complexity, Int. J. Algebra Comput. 26(04) (2016) 727–750.] We previously constructed a monoid [Formula: see text] that is non-regular iff NP [Formula: see text] P . We now construct homomorphic images of [Formula: see text] with interesting properties. In particular, the homomorphic image [Formula: see text] of [Formula: see text] is finitely generated, and is n

APA, Harvard, Vancouver, ISO, and other styles

9

Hitchcock, John M., Adewale Sekoni, and Hadi Shafei. "Polynomial-Time Random Oracles and Separating Complexity Classes." ACM Transactions on Computation Theory 13, no. 1 (2021): 11–16. http://dx.doi.org/10.1145/3434389.

Full text

Abstract:

Bennett and Gill [1981] showed that P A ≠ NP A ≠ coNP A for a random oracle A , with probability 1. We investigate whether this result extends to individual polynomial-time random oracles. We consider two notions of random oracles: p-random oracles in the sense of martingales and resource-bounded measure [Lutz 1992; Ambos-Spies et al. 1997], and p-betting-game random oracles using the betting games generalization of resource-bounded measure [Buhrman et al. 2000]. Every p-betting-game random oracle is also p-random; whether the two notions are equivalent is an open problem. (1) We first show th

APA, Harvard, Vancouver, ISO, and other styles

10

de Figueiredo, Celina M. H. "The P versus NP–complete dichotomy of some challenging problems in graph theory." Discrete Applied Mathematics 160, no. 18 (2012): 2681–93. http://dx.doi.org/10.1016/j.dam.2010.12.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

P. Kulkarni, Suhas, and Jai Prakash Jaiswal. "Efficacy of Nasal Continuous Positive Airway Pressure Delivered by Nasal mask Versus Nasal Prongs in Neonates." Journal of Nepal Paediatric Society 43, no. 2 (2023): 138–42. https://doi.org/10.60086/jnps544.

Full text

Abstract:

Introduction: Nasal continuous positive airway pressure (CPAP) is the standard therapy for neonatal respiratory distress. It is delivered using nasal mask (NM) or nasal prong (NP), both of which can result in nasal trauma. The type of nasal interface used is an important determinant of nasal injury. The superiority of one over the other is debatable necessitating further research to identify the more efficacious, safe and convenient nasal continuous positive airway pressure (CPAP) interface. This study was conducted to compare the efficacy of NM Nasal continuous positive airway pressure (CPAP)

APA, Harvard, Vancouver, ISO, and other styles

12

Copertari, Luis F. "Very Near Optimal Algorithm for the Traveling Salesman Problem." Advances in Social Sciences Research Journal 11, no. 5 (2024): 153–58. http://dx.doi.org/10.14738/assrj.115.16991.

Full text

Abstract:

The Traveling Salesman Problem (TSP) is a P versus NP key problem that can be generalized to some instances of other problems. Using the commercial state-of-the-art branch-and-bound mixed integer linear programming solver (LINGO) solves the TSP problem in an amount of time that is proportional to a quadratic multiplied by an exponential of base two as a function of the number of cities or destinations. My algorithm solves the problem in a quadratic amount of time as a function of the number of cities or destinations. My algorithm basically solves the problem by sorting the cells in the cost or

APA, Harvard, Vancouver, ISO, and other styles

13

Kedyk, I., and M. Stanislavchuk. "AB1007 NEUROPATHIC PAIN AS A PREDICTOR OF FUNCTIONAL DISORDERS IN PATIENTS WITH ANKYLOSING SPONDYLITIS." Annals of the Rheumatic Diseases 82, Suppl 1 (2023): 1725.1–1725. http://dx.doi.org/10.1136/annrheumdis-2023-eular.1949.

Full text

Abstract:

BackgroundAnkylosing spondylitis (AS) is one of the most actual problems in modern rheumatology. AS is characterized by a violation of functional abilities, which causes a decrease in the quality of life and invalidation of patients. The main symptom of AS is chronic pain, which persists in some cases not only due to inflammation, but also due to the neuropathic component of pain, however, this issue needs additional investigation [1].ObjectivesTo assess functional status and its association with neuropathic pain in patients with AS.MethodsFollowing the principles of biomedical ethics, on the

APA, Harvard, Vancouver, ISO, and other styles

14

Liu, Fushui, Ting Fang, Fanyuan Zhou, et al. "Association of Depression/Anxiety Symptoms with Neck Pain: A Systematic Review and Meta-Analysis of Literature in China." Pain Research and Management 2018 (September 25, 2018): 1–9. http://dx.doi.org/10.1155/2018/3259431.

Full text

Abstract:

Background. Due to its high morbidity and prevalence, the potential relationships of depression/anxiety symptoms in neck pain (NP) are not well demonstrated. Objectives. This study aimed to conduct a comprehensive estimation of controlled trials of psychological problems and to test hypotheses concerning whether NP was statistically relative to anxiety/depression symptoms. Methods. Chinese literature databases such as the China National Knowledge Infrastructure (CNKI), VIP Information (VIP), Chinese Biomedicine (CBM), and Wanfang Data (WANFANG) were scientifically searched for reports publishe

APA, Harvard, Vancouver, ISO, and other styles

15

Nanongkai, Danupon, and Michele Scquizzato. "Equivalence classes and conditional hardness in massively parallel computations." Distributed Computing 35, no. 2 (2022): 165–83. http://dx.doi.org/10.1007/s00446-021-00418-2.

Full text

Abstract:

AbstractThe Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on c

APA, Harvard, Vancouver, ISO, and other styles

16

Han, Joseph, Joseph Owen Hendley, and Birgit Winther. "Bacterial Origin of Ostiomeatalcomplex after Viral Infection." Otolaryngology–Head and Neck Surgery 139, no. 2_suppl (2008): P73. http://dx.doi.org/10.1016/j.otohns.2008.05.236.

Full text

Abstract:

Objective After a viral infection in the nasal cavity or sinus, superimposed bacteria infection is likely to occur. Therefore the carriage rate of bacterial pathogen in the nasal cavity (NC), nasopharynx (NP), and ostiomeatal complex (OMC) were determined during wellness and upper respiratory viral infection. Methods There were 2 groups in the study. The control group was well with no nasal or sinus problems. The cohort group had an upper respiratory viral infection. The NC, NP, and OMC cultures were taken from each study group. Agars cultured were used to detect S. pneumoniae, H. influenzae,

APA, Harvard, Vancouver, ISO, and other styles

17

Temur, Z. Kalanov. "BRAIN Journal - Man versus Computer: Difference of the Essences. The Problem of the Scientific Creation." BRAIN: Broad Research in Artificial Intelligence and Neuroscience 8, no. 2 (2017): 151–78. https://doi.org/10.5281/zenodo.1045075.

Full text

Abstract:

ABSTRACT In this study it is proposed the critical analysis of the creation of Artificial Intelligence (AI) and of Artificial General Intelligence (AGI). The unity of formal logic and rational dialectics is the methodological basis of the analysis. The main results of the analysis are as follows: (1) the model of man represents the unity of the two material aspects: “physiological body” (controllable aspect) and “psychical body” (controlling aspect); (2) the “psychical body” is the subsystem “subconsciousness + consciousness”; (3) in the comprehensive sense of the word, the thinking is an attr

APA, Harvard, Vancouver, ISO, and other styles

18

Akbar, Roby Rahmadi, Muh Thohar Arifin, and Nana Rochana. "Efek Posisi Orthopneic Terhadap Fungsi Pernafasan: Systematic Review." Jurnal Ilmiah Kesehatan 13, no. 2 (2020): 59–68. http://dx.doi.org/10.48144/jiks.v13i2.252.

Full text

Abstract:

Gangguan fungsi pernafasan merupakan masalah yang sering muncul pada pasien Penyakit Paru Obstruktif Kronis (PPOK). Posisi orthopneic adalah intervensi nonfarmakologi yang dapat diberikan pada pasien PPOK. Akan tetapi, sejauh ini belum cukup bukti tentang pengaruh posisi orthopneic terhadap fungsi pernafasan karena outcome yang berbeda-beda. penelitian ini bertujuan untuk mengetahui pengaruh posisi orthopneic terhadap fungsi pernafasan pada pasien PPOK. Kriteria inklusi pada review ini adalah: studi eksperimental, pasien dewasa dengan PPOK derajat sedang sampai berat. Adapun keriteria ekslusi

APA, Harvard, Vancouver, ISO, and other styles

19

Sidon, Eliezer, Elizabeth McDonald, Annemarie Daecher, et al. "Prevalence of neuropathic pain in the foot and ankle patients." Foot & Ankle Orthopaedics 3, no. 3 (2018): 2473011418S0044. http://dx.doi.org/10.1177/2473011418s00448.

Full text

Abstract:

Category: Other Introduction/Purpose: The management of pain in patients with foot and ankle pain can be challenging. Cumulative data suggest that, in addition to nociceptive mechanisms, other neuropathic mechanisms can contribute to pain in a subset of people with osteoarthritis. Neuropathic mechanism include central sensitization or peripheral neuropathic hyper activated pain. Heterogeneous pain mechanisms may explain variable responses to recommended pain therapies. Accurate classification of pain phenotype using clinically feasible tools has potential to improve pain management. The PainDE

APA, Harvard, Vancouver, ISO, and other styles

20

Landsberg, J. M. "P versus NP and geometry." Journal of Symbolic Computation 45, no. 12 (2010): 1359–77. http://dx.doi.org/10.1016/j.jsc.2010.06.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Jiang, Yaozhi. "A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine." Journal of Mathematics Research 12, no. 4 (2020): 1. http://dx.doi.org/10.5539/jmr.v12n4p1.

Full text

Abstract:

P vs. NP problem is very important research direction in computation complexity theory. In this paper author, by an engineer&rsquo;s viewpoint, establishes universal multiple-tape Turing-machine and k-homogeneous multiple-tape Turing-machine, and by them we can obtain an unified mathematical model for algorithm-tree, from the unified model for algorithm-tree, we can conclude that computation complexity for serial processing NP problem if under parallel processing sometimes we can obtain P=NP&nbsp; in time-complexity, but that will imply another NP, non-deterministic space-complexity NP

APA, Harvard, Vancouver, ISO, and other styles

22

Magnifico, Maria Chiara, Marla Xhani, Milica Popov, Luciano Saso, Paolo Sarti, and Marzia Arese. "Nonylphenol and Octylphenol Differently Affect Cell Redox Balance by Modulating the Nitric Oxide Signaling." Oxidative Medicine and Cellular Longevity 2018 (2018): 1–13. http://dx.doi.org/10.1155/2018/1684827.

Full text

Abstract:

Nonylphenol (NP) and octylphenol (OP) are pervasive environmental contaminants belonging to the broader class of compounds known as alkylphenols, with potential human toxic effects. Classified as “xenoestrogens,” NP and OP are able to interfere with the cell endocrine physiology via a direct interaction with the estrogen receptors. Here, using HepG2 cells in culture, the changes of the cell redox balance and mitochondrial activity induced by OP and NP have been investigated at μM concentrations, largely below those provoking acute toxicity, as those typical of environmental contaminants. Follo

APA, Harvard, Vancouver, ISO, and other styles

23

Osorio-Arciniega, Rodrigo, Eduardo Lucero-Meza, Bonifacio Can-Uc, et al. "Abstract 4147: Chitosan luminescent rare-earth doped nanoparticles as cancer cell tracking for imaging tumors and their immune response." Cancer Research 84, no. 6_Supplement (2024): 4147. http://dx.doi.org/10.1158/1538-7445.am2024-4147.

Full text

Abstract:

Abstract Background: Cancer is a group of diseases characterized by the unregulated growth of cells, which can be hard to diagnose due to the high false negatives or positives derived from technical and human mistakes.The detection of solid tumors during resection surgery is also a common issue, so contrast agents are used for both cancer diagnosis and tumor visualization during surgery, facilitating the tumor resection procedure. Nevertheless, they cause long-term problems because they accumulate in specific tissues, low penetration, and rapid clearance from the circulation. It is necessary t

APA, Harvard, Vancouver, ISO, and other styles

24

Синчев, Б. К. "ON THE MILLENNIUM PROBLEM FOR P & NP CLASSES." INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGIES 4, no. 2(14) (2024): 94–101. http://dx.doi.org/10.54309/ijict.2023.14.2.009.

Full text

Abstract:

Проблема равенства классов P и NP сведена к решению задачи о сумме подмножеств⊆, множество целых положительных чисел без повторений. Доказана линейная (либо квадратичная ) разрешимость поставленной задачи, которая принадлежит классу NP-complete. Требуемое пространство равно Таким образом, линейная разрешимость и полнота subset sum problem подтверждают равенство классов P и NP.

APA, Harvard, Vancouver, ISO, and other styles

25

Hartmanis, J., N. Immerman, and V. Sewelson. "Sparse sets in NP-P: EXPTIME versus NEXPTIME." Information and Control 65, no. 2-3 (1985): 158–81. http://dx.doi.org/10.1016/s0019-9958(85)80004-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Cook, Stephen. "The importance of the P versus NP question." Journal of the ACM 50, no. 1 (2003): 27–29. http://dx.doi.org/10.1145/602382.602398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Saxena, Vatsal. "Analysis of Polynomial Time and Non-Polynomial Time of Algorithms." International Journal for Research in Applied Science and Engineering Technology 11, no. 5 (2023): 3311–16. http://dx.doi.org/10.22214/ijraset.2023.52268.

Full text

Abstract:

Abstract: The P vs NP problem is one of the most significant open problems in computer science and mathematics. This problem asks whether every problem that can be solved in polynomial time can also be verified in polynomial time. The purpose of this research paper is to explore the P vs NP problem and its relevance in the analysis of algorithms. We will discuss the techniques used to design and analyze algorithms, such as divide-and-conquer, dynamic programming, and greedy algorithms, and their relation to the P vs NP problem. We will also examine some examples of polynomial-time algorithms a

APA, Harvard, Vancouver, ISO, and other styles

28

Rich, Craig A. "Positive relativizations of the P = ? NP problem." Journal of Computer and System Sciences 38, no. 3 (1989): 511–23. http://dx.doi.org/10.1016/0022-0000(89)90014-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Mateescu, A., A. Salomaa, K. Salomaa, and S. Yu. "P, NP, and the Post Correspondence Problem." Information and Computation 121, no. 2 (1995): 135–42. http://dx.doi.org/10.1006/inco.1995.1128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Jukna, Stasys. "On the P versus NP intersected with co-NP question in communication complexity." Information Processing Letters 96, no. 6 (2005): 202–6. http://dx.doi.org/10.1016/j.ipl.2005.08.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

SALO, RUTH, AVISHAI HENIK, THOMAS E. NORDAHL, and LYNN C. ROBERTSON. "Immediate versus sustained processing in schizophrenia." Journal of the International Neuropsychological Society 8, no. 6 (2002): 794–803. http://dx.doi.org/10.1017/s1355617702860076.

Full text

Abstract:

A Stroop negative priming (NP) task was used to assess immediate selective attention and priming in schizophrenia and schizoaffective disorder. Subject groups were comprised of 12 state hospital inpatients (41.8 ± 7.5 years of age), 11 outpatients (39.8 ± 7.5 years of age), and 16 controls (36.4 ± 11.7 years of age). Compared with the control group and the outpatients, inpatients failed to exhibit NP [F(2,36) = 6.09, p < .01], despite exhibiting equivalent Stroop RT interference (p > .05). Error rates did not differ significantly between the 3 groups. Although medication types and dosage

APA, Harvard, Vancouver, ISO, and other styles

32

Mahmoud, Nafie, el Maleh Haitham, Saad Farahat Mahmoud, and El Rahman M. El Maraghy Abd. "Study of the Effect of Preoperative Dexamethasone before Total Thyroidectomy on Postoperative Nausea, Vomiting, Pain and Voice Dysfunction." Biolife 8, no. 1 (2022): 1–9. https://doi.org/10.5281/zenodo.7404199.

Full text

Abstract:

<strong>ABSTRACT</strong> The study was conducted in Ain Shams University Hospitals. It was a prospective randomized comparative study. Based on the results and data compared between the two groups preoperative dose of dexamethasone is recommended prior to total thyroidectomy operations, due to its beneficial effect in diminishing probability of occurrence of postoperative voice changes, pain and dyspepsia. <strong>Key words:</strong>Thyroid, Dexamethasone, cartilage, trachea, chemotherapy. <strong>REFERENCES</strong> Aburahma AF, Choueiri MA. Cranial and cervical nerve injuries after repeat c

APA, Harvard, Vancouver, ISO, and other styles

33

Smith, Justin S., Christopher I. Shaffrey, Han Jo Kim, et al. "Comparison of Best Versus Worst Clinical Outcomes for Adult Cervical Deformity Surgery." Global Spine Journal 9, no. 3 (2018): 303–14. http://dx.doi.org/10.1177/2192568218794164.

Full text

Abstract:

Study Design: Retrospective cohort study. Objective: Factors that predict outcomes for adult cervical spine deformity (ACSD) have not been well defined. To compare ACSD patients with best versus worst outcomes. Methods: This study was based on a prospective, multicenter observational ACSD cohort. Best versus worst outcomes were compared based on Neck Disability Index (NDI), Neck Pain Numeric Rating Scale (NP-NRS), and modified Japanese Orthopaedic Association (mJOA) scores. Results: Of 111 patients, 80 (72%) had minimum 1-year follow-up. For NDI, compared with best outcome patients (n = 28), w

APA, Harvard, Vancouver, ISO, and other styles

34

Wolff, Bernard J., Anna M. Bramley, Kathleen A. Thurman, et al. "Improved Detection of Respiratory Pathogens by Use of High-Quality Sputum with TaqMan Array Card Technology." Journal of Clinical Microbiology 55, no. 1 (2016): 110–21. http://dx.doi.org/10.1128/jcm.01805-16.

Full text

Abstract:

ABSTRACTNew diagnostic platforms often use nasopharyngeal or oropharyngeal (NP/OP) swabs for pathogen detection for patients hospitalized with community-acquired pneumonia (CAP). We applied multipathogen testing to high-quality sputum specimens to determine if more pathogens can be identified relative to NP/OP swabs. Children (<18 years old) and adults hospitalized with CAP were enrolled over 2.5 years through the Etiology of Pneumonia in the Community (EPIC) study. NP/OP specimens with matching high-quality sputum (defined as ≤10 epithelial cells/low-power field [lpf] and ≥25 white blood c

APA, Harvard, Vancouver, ISO, and other styles

35

Coxson, Gregory E. "The P-matrix problem is co-NP-complete." Mathematical Programming 64, no. 1-3 (1994): 173–78. http://dx.doi.org/10.1007/bf01582570.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Tianyi, Jamie N. Mills, Brandon Ellsworth, et al. "Perioperative versus adjuvant therapy in resectable pancreas cancer." Journal of Clinical Oncology 43, no. 4_suppl (2025): 703. https://doi.org/10.1200/jco.2025.43.4_suppl.703.

Full text

Abstract:

703 Background: Pancreatic ductal adenocarcinoma (PDAC) is the third-leading cause of cancer death in the United States with a 5-year survival rate of 13%. Recurrence rates are high following resection and optimization of neoadjuvant and adjuvant therapy remains under investigation, with the hypothesis that neoadjuvant/perioperative therapy may convert borderline resectable tumors to resectable and prevent progression of micro-metastases in the postoperative setting. Our study evaluates patient outcomes and models predictive and prognostic markers to assist with clinical decision-making in con

APA, Harvard, Vancouver, ISO, and other styles

37

Stanton, Eloise, Kara McMullen, Paul Won, et al. "89 Neuropathic Pain After Burn Injury: A Severe but Common Problem in Recovery." Journal of Burn Care & Research 45, Supplement_1 (2024): 71–72. http://dx.doi.org/10.1093/jbcr/irae036.088.

Full text

Abstract:

Abstract Introduction Neuropathic pain (NP) is a poorly studied but common complaint of burn survivors and severely limits patients in regard to quality of life and function well after their burn injury. Currently, there is a paucity of data on the association between NP and its sequelae with burn survivors in the literature. As such, the purpose of this study is to better understand the incidence of NP and associated factors on a national scale using the Burn Model System (BMS) National Database. Methods The BMS National Database was queried to identify burn patients responding to the primary

APA, Harvard, Vancouver, ISO, and other styles

38

Dantas, Simone, Luerbio Faria, Celina M. H. de Figueiredo та Rafael B. Teixeira. "The ( k , ℓ ) unpartitioned probe problem NP-complete versus polynomial dichotomy". Information Processing Letters 116, № 4 (2016): 294–98. http://dx.doi.org/10.1016/j.ipl.2015.11.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Dantas, Simone, Luerbio Faria, Celina M. H. de Figueiredo та Rafael B. Teixeira. "The (k,ℓ)partitioned probe problem: NP-complete versus polynomial dichotomy". Discrete Applied Mathematics 234 (січень 2018): 67–75. http://dx.doi.org/10.1016/j.dam.2017.02.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Jukna, S., A. Razborov, P. Savicky, and I. Wegener. "On P versus NP $ \cap $ co-NP for decision trees and read-once branching programs." Computational Complexity 8, no. 4 (1999): 357–70. http://dx.doi.org/10.1007/s000370050005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

SANCHIS, LAURA A. "CONSTRUCTING LANGUAGE INSTANCES BASED ON PARTIAL INFORMATION." International Journal of Foundations of Computer Science 05, no. 02 (1994): 209–29. http://dx.doi.org/10.1142/s0129054194000116.

Full text

Abstract:

We investigate the problem of when it is possible to efficiently construct an instance of a given language in P or NP, based on partial information provided about the desired instance. We model this problem by specifying a prefix and a length for the string to be produced. Our results suggest that it may be harder to find efficient constructors for languages in NP if more information is provided about the desired element (assuming that P is not equal to NP). Specifically, for large enough prefix functions, polynomial-time prefix-based constructors cannot exist for all languages in NP unless P=

APA, Harvard, Vancouver, ISO, and other styles

42

Rong, Katie, Grace Lee, and Meghan Herbst. "Effectiveness of Near-Peer Versus Faculty Point-of-Care Ultrasound Instruction to Third-Year Medical Students." POCUS Journal 7, no. 2 (2022): 239–44. http://dx.doi.org/10.24908/pocus.v7i2.15746.

Full text

Abstract:

Background: Incorporation of point-of-care ultrasound (POCUS) in undergraduate medical education (UME) is expanding; however, its effective implementation is impeded by a lack of trained faculty. Recruitment of near-peer (NP) instructors is a potential solution, but there are concerns surrounding NP teaching effectiveness compared to faculty instruction. While some institutions have assessed supplemental NP instruction, or NP-taught sessions with strict faculty supervision, few if any have compared effectiveness of NP POCUS instruction alone to faculty instruction through a multi-dimensional a

APA, Harvard, Vancouver, ISO, and other styles

43

Lumban Gaol, Ford, and Tokuro Matsuo. "Solving the Graph Problem on the Maximal Clique Problem on the P-Systems with Mitochondria Enzymes Layer." Applied Sciences 10, no. 1 (2019): 275. http://dx.doi.org/10.3390/app10010275.

Full text

Abstract:

P systems with mitochondria enzymes layer computing is a recent version of P systems; it integrates a new feature inspired from the enzymes gate of a natural cell to the cell-like P systems. The model of a computational layer is well known as a problem of Non-Deterministic (NP-complete) in polynomial time. In this paper, we propose a P systems with enzymes to solve one of the most NP-hard problems, which is the determination of the maximal clique in a given undirected graph. In this context, the evolution strategy proposed is based on using objects under the control of enzymes placed on layers

APA, Harvard, Vancouver, ISO, and other styles

44

LÓPEZ WONG, JAVIER. "ALGORITMO DE COBERTURA DE VÉRTICES." Revista Ingeniería, Matemáticas y Ciencias de la Información 10, no. 20 (2023): 123–25. http://dx.doi.org/10.21017/rimci.2023.v10.n20.a146.

Full text

Abstract:

Problem to solve P=NP, using the coverage problem of a graph that is NP and convert it to P. In the mathematical discipline of graph theory, a vertex cover, simply a graph cover, is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding the smallest vertex coverage in a graph is called the vertex coverage problem. In computational complexity theory, it has been shown that this is an NP-complete problem. An NPcomplete problem is that it is not known if it has a Polynomial solution. I have found an algorithm that proves that it is

APA, Harvard, Vancouver, ISO, and other styles

45

Naik, A. V., and A. L. Selman. "Adaptive versus nonadaptive queries to NP and p-selective sets." Computational Complexity 8, no. 2 (1999): 169–87. http://dx.doi.org/10.1007/s000370050026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

WILLENBROCK, ROLAND, INES PAGEL, MICHAELA SCHEUERMANN, et al. "Renal Function in High-Output Heart Failure in Rats." Journal of the American Society of Nephrology 10, no. 3 (1999): 572–80. http://dx.doi.org/10.1681/asn.v103572.

Full text

Abstract:

Abstract. The physiologic and pathophysiologic importance of natriuretic peptides (NP) has been imperfectly defined. The diminished renal responses to exogenous atrial NP in heart failure have led to the perception that the endogenous NP system might be less effective and thus contribute to renal sodium retention in heart failure. This study tests the hypothesis that in experimental heart failure, the renal responses to an acute volume load are still dependent on the NP system. The specific antagonist HS-142-1 was used to block the effects of NP in a model of high-output heart failure induced

APA, Harvard, Vancouver, ISO, and other styles

47

Kompatscher, Michael. "The equation solvability problem over supernilpotent algebras with Mal’cev term." International Journal of Algebra and Computation 28, no. 06 (2018): 1005–15. http://dx.doi.org/10.1142/s0218196718500443.

Full text

Abstract:

In 2011, Horváth gave a new proof that the equation solvability problem over finite nilpotent groups and rings is in P. In the same paper, he asked whether his proof can be lifted to nilpotent algebras in general. We show that this is in fact possible for supernilpotent algebras with a Mal’cev term. However, we also describe a class of nilpotent, but not supernilpotent algebras with Mal’cev term that have co-NP-complete identity checking problems and NP-complete equation solvability problems. This proves that the answer to Horváth’s question is negative in general (assuming P[Formula: see text

APA, Harvard, Vancouver, ISO, and other styles

48

Wang, Steven Y., Nairne W. Scott-Douglas, Dante E. Manyari, and John V. Tyberg. "Arterial versus venous changes in vascular capacitance during nitroprusside infusion: a vascular modelling study." Canadian Journal of Physiology and Pharmacology 77, no. 2 (1999): 131–37. http://dx.doi.org/10.1139/y99-013.

Full text

Abstract:

The distributions of nitroprusside (NP) induced changes in vascular capacitance, arterial versus venous, are unknown. We measured canine ileal arterial and venous pressures and total (isolated loop) vascular volumes (scintigraphy), before and during NP infusion. NP sufficient to decrease perfusion pressure by 30% increased total vascular volume to 111 ± 3% (± SEM) of control (p < 0.01). Increasing flow to restore perfusion pressure increased volume 4% more (p < 0.01). Assuming a two-compartment model and on the basis of the literature data, changes in venous capacitance were estimated an

APA, Harvard, Vancouver, ISO, and other styles

49

Zaitseva, E. L., A. Yu Tokmakova, L. P. Doronina, I. A. Voronkova, G. R. Galstyan, and M. V. Shestakova. "Impact of various wound dressings on wound bed neoangiogenesis in patients with different forms of diabetic foot syndrome." Terapevticheskii arkhiv 89, no. 10 (2017): 12–16. http://dx.doi.org/10.17116/terarkh2017891012-16.

Full text

Abstract:

Aim. To investigate the impact of various wound dressings on wound bed neoangiogenesis in patients with different forms of diabetic foot syndrome (DFS). Subjects and methods. The clinical (local tissue oxygenation) and immunohistochemical (CD31) markers of foot soft tissue neoangiogenesis were evaluated in patients with DFS receiving negative pressure (NP) therapy and collagen-containing dressings (CCDs) versus standard treatment. 63 patients with neuropathic and neuroischemic (without critical ischemia) forms of DFS were examined after wound debridement. In the postoperative period, 21 patien

APA, Harvard, Vancouver, ISO, and other styles

50

Takeuti, Gaisi, and Masahiro Yasumoto. "Forcing on bounded arithmetic II." Journal of Symbolic Logic 63, no. 3 (1998): 860–68. http://dx.doi.org/10.2307/2586716.

Full text

Abstract:

Forcing method on Bounded Arithmetic was first introduced by J. B. Paris and A. Wilkie in [10]. Then in [1], [2] and [3], M. Ajtai used the method to get excellent results on the pigeon hole principle and the modulo p counting principle. The forcing method on Bounded arithmetic was further developed by P. Beame, J. Krajíček and S. Riis in [4], [7], [6], [8], [5], [12], [11], [13]. It should be noted that J. Krajíček and P. Pudlák used an idea of Boolean valued in [9] and also Boolean valued notion is efficiently used for model theoretic constructions in [7], [6], [8], [5].In our previous paper

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!