Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

418 articles for “p and np Complexity”
Set a search alert
Also matching:2 special issues
Research ArticleOpen accessIn the keywordsCharacterization of Reconstructed Basins Using Pattern Spectrum ProcedureP. RadhakrishnanSeveral classical and Fractal binary shapes, which are akin to geophysical shapes such as basins, lakes, and pore-grain spruce, are analyzed and characterized by employing various mathematical morphological transformations, and methods. By employing rhombus, square and octagon structuring elements, these shapes are decomposed into their skeletal networks and their corresponding skeletal network subsets are dilated to the respective degree by … …American Journal of Applied Sciences, Vol. 2, Issue 4 · 30 Apr 2005 · 6,932 accessesView PDFCite
Review ArticleOpen accessIn the keywordsA Survey of Quadratization Methods Used in QUBO Formulations and their Usage in Quantum and Digital AnnealingGeethika Prabhath, Anuradha Mahasinghe, Nalin Ranasinghe, Kasun De ZoysaQuantum annealing is a metaheuristic method aimed at finding the global minimum of a pseudo-Boolean quadratic function. To solve a problem by a quantum annealer, it must be restated as a QUBO (quadratic unconstrained binary optimization) problem, the standard format acceptable to an annealer. However, there are many natural problems that turn out be of cubic or higher order, yet … …Journal of Computer Science, Vol. 22, Issue 1 · 16 Feb 2026 · 2,554 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Comparative Computational Efficiency Analysis of LSB and Hybrid Steganographic MethodsDivya Sharma, Chander PrabhaElectronic Medical Images (EMI) are of various types such as X-rays, CT scans, MRIs, etc. EMIs are generally large, but they vary in dimensions and sizes based on the body part to which they belong. Not much research has been done to secure EMIs due to their varied and large sizes, while ensuring their accessibility for real-time transmission. Where access … …Journal of Computer Science, Vol. 21, Issue 10 · 28 Nov 2025 · 2,458 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOn a Proof of Inequality of PvsNPAngelo Raffaele MeoThis study is a new version of a previous paper. Its purpose is to simplify some sections of the old version and, above all, to present the proofs of some theorems which had been omitted for the sake of brevity. The analysis discussed in this study and its previous version is based on a well-known NP-complete problem which is called … …Journal of Computer Science, Vol. 19, Issue 1 · 16 Jan 2023 · 7,531 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAnalytical Fractured Reservoir Characterization by using Geological and Petrophysical LogsZohreh Movahed, Farzaneh AghajariDue to structural complexities in some wells, higher than the expected thickness of the Asmari formation is found. Fracture intensity and deep-rooted fractures broadly increase the risk of unpredictable water production. The well-test analysis is not sufficient in describing fracture properties. Unfortunately, the core condition is poor in the fractured zones and cannot be used to provide reliable information. So, … …Current Research in Geoscience, Vol. 12, Issue 1 · 3 Dec 2022 · 9,927 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOn the P VS NP Question: A New Proof of InequalityAngelo Raffaele MeoThe analysis discussed in this study is based on a well-known NP-complete problem which is called “satisfiability problem or SAT”. From SAT a new NP-complete problem derives, which is described by a Boolean function of the number n of the clauses of SAT called “core function”. In this study a new proof is presented according which the number of gates … …Journal of Computer Science, Vol. 17, Issue 5 · 27 May 2021 · 9,442 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOptimising Pair Programming in a Scholastic Framework: A Design Pattern PerspectiveSmitha Rajagopal, Katiganere Siddaramappa Hareesha, Poornima Panduranga KundapurPair programming is one of the widely used practices of Extreme Programming (XP). XP is a software development process which intends to enhance quality of software code in order to cater to the ever increasing demands of customers looking for IT solutions. Pair programming promotes team building, raises confidence among individuals and eventually results in richer and a better codebase. … …Journal of Computer Science, Vol. 13, Issue 6 · 20 May 2017 · 7,250 accessesView PDFCite
Research NotesOpen accessIn the keywordsNew Research Perspectives on Thermostatted Kinetic ModelsCarlo BiancaThis paper presents the new research directions that can be followed in the modeling of complex living systems by means of the tools of the thermostatted kinetic theory. The main aim is to invite the researchers that work in the field of applied mathematics to contribute to further developments of the theory with particular attention to applications in biology, crowds … …Journal of Mathematics and Statistics, Vol. 11, Issue 1 · 9 Jun 2015 · 6,658 accessesView PDFCite
Research ArticleOpen accessIn the keywordsImproving the Attack Detection Rate in Network Intrusion Detection using Adaboost AlgorithmP. Natesan, P. Balasubramanie, G. GowrisonProblem statement: Nowadays, the Internet plays an important role in communication between people. To ensure a secure communication between two parties, we need a security system to detect the attacks very effectively. Network intrusion detection serves as a major system to work with other security system to protect the computer networks. Approach: In this article, an Adaboost algorithm for network … …Journal of Computer Science, Vol. 8, Issue 7 · 16 May 2012 · 7,461 accessesView PDFCite
Research ArticleOpen accessIn the keywordsUsing Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment AlgorithmsEvandro A. Marucci, Geraldo F.D. Zafalon, Julio C. Momente et al.Problem statement: The parallelization of multiple progressive alignment algorithms is a difficult task. All known methods have strong bottlenecks resulting from synchronization delays. This is even more constraining in distributed memory systems, where message passing also delays the interprocess communication. Despite these drawbacks, parallel computing is becoming increasingly necessary to perform multiple sequence alignment. Approach: In this study, it is … …Current Research in Bioinformatics, Vol. 1, Issue 1 · 8 Mar 2012 · 14,192 accessesView PDFCite