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 accessEvery word in the titleEmpirical Analysis and Mathematical Representation of the Path Length Complexity in Binary Decision DiagramsA. Assi, P. W.C. Prasad, B. Mills, A. ElchouemiInformation about the distribution of path-lengths in a Binary Decision Diagrams (BDDs) representing Boolean functions is useful in determining the speed of hardware and software implementations of the circuit represented by these Boolean functions. This study presents expressions produced from an empirical analysis of a representative collection of Boolean functions. The Average Path Length (APL) and the Shortest Path Length … …Journal of Computer Science, Vol. 2, Issue 3 · 31 Mar 2006 · 6,814 accessesView PDFCite
Research ArticleOpen accessIn the keywordsp ≠ np: The Set of Deterministic Problems that are Solvable in Polynomial Time is Unequal to the Set of Non-Deterministic Problems that are Solvable in Polynomial TimeAndres BoldoriThis study constructs a solution to the “p vs. np” problem using complexity theory. We show through counterexamples that p ≠ np and formalize the two sets using stochastic, probabilistic and non-deterministic modeling. While the well-known sets “pspace” and “npspace”, analyzing the storage of a device, can be claimed to be equal, p and np differ and are exclusively defined … …Journal of Computer Science, Vol. 20, Issue 10 · 8 Aug 2024 · 7,106 accessesView PDFCite
Research ArticleOpen accessIn the keywordsPerformance Analysis of Two Famous Cryptographic Algorithms on Mixed DataEmmanuel Abidemi Adeniyi et al.The rapid development of digital data sharing has made information security a crucial concern in data communication. The information security system heavily relies on encryption methods. These algorithms employ strategies to increase data secrecy and privacy by obscuring the information, which only those parties who have the accompanying key can decode or decrypt. Nevertheless, these methods also use a lot … …Journal of Computer Science, Vol. 19, Issue 6 · 29 May 2023 · 6,020 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe New Matrix Model of Computation Based Purely on Quite a New Concept of the Matrix Computations for Extremely Quick Web Pages LoadingZulfia A. ChotchaevaWe all dream of quick loading. Quicker than it is now. So that it loads immediately. What is needed for this? There are a lot of things to do. The most important things in it are computations. To speed up loading, we need to speed up computations. If we will find the way to multiply large numbers quicker than we … …Journal of Computer Science, Vol. 16, Issue 11 · 27 Nov 2020 · 10,683 accessesView PDFCite
Review ArticleOpen accessIn the keywordsAn Investigation into the Challenges and Opportunities Associated with the Application of Internet of Things (IoT) in the Agricultural Sector-A ReviewSarfraz Fayaz Khan, Mohammed Yusoof IsmailInternet of things has acquired attention all over the globe. It has transformed the agricultural field and allowed farmers to compete with massive issues they face. The aim of this paper is to review the various challenges and opportunities associated with the applications of internet of things in agricultural sector. This research makes use of secondary sources that have been … …Journal of Computer Science, Vol. 14, Issue 2 · 6 Sep 2017 · 9,151 accessesView PDFCite
Research ArticleOpen accessIn the keywordsEvaluation Metrics for Wireless Sensor Network Security: Algorithms Review and Software ToolQasem Abu Al-Haija, Mohamed H. Shwehdi, Muhammad BanatWireless Sensor Networks (WSN) is currently receiving a significant attention due to their potential impact into several real life applications such as military and home automation technology. The work in this study is a complementary part of what’s discussed. In this study, we propose a software tool to simulate and evaluate the six evaluation metrics presented for non-deterministic wireless sensor … …Journal of Computer Science, Vol. 9, Issue 5 · 27 May 2013 · 7,348 accessesView PDFCite
Research ArticleOpen accessIn the keywordsPAPR Reduction Using BPSO/PTS and STBC in MIMO OFDM SystemKarima El Mouhib, Ahmed Oquour, Younes Jabrane et al.Problem statement: The Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) system has been receiving a great attention, as one of solutions for achieving high speed, efficient and high-quality service for the wireless communications. However, the transmitted signal still has high PAPR because of OFDM characteristics. Many methods have been proposed to solve this problem, but the most … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 7,189 accessesView PDFCite
Research ArticleOpen accessIn the keywordsEfficient Detection Algorithm for a Multiple-Input and Multiple-Output Multiuser Multi-Carrier Code Division Multiple Access in Time-Varying ChannelsFares Sayadi, Mahamod Ismail, Norbahiah Misran et al.Problem statement: Maximum Likelihood (ML) decoding has been applied for the uplink of a Multi-Carrier Code Division Multiple Access (MC-CDMA) system based on Orthogonal Frequency Division Multiplexing (OFDM). Multiple-Input Multiple-Output (MIMO) channel from k users, which moves at vehicular speed, to the Base-Station (BS) is time-varying. For time-varying channels, Sphere Decoding (SD) was introduced to perform ML decoding. Whereas, computational … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 7,576 accessesView PDFCite
Research ArticleOpen accessIn the keywordsInteger Factorization: Solution via Algorithm for Constrained Discrete Logarithm ProblemBoris S. VerkhovskyProblem statement: During the last thirty years many public-key cryptographic protocols based on either the complexity of integer factorization of large semiprimes or the Discrete Logarithm Problem (DLP) have been developed. Approach: Although several factorization algorithms with sub-exponential complexity have been discovered, the recent RSA Factoring Challenge demonstrated that it was still necessary to use several thousand computers working in … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Dec 2009 · 7,156 accessesView PDFCite
Research ArticleOpen accessIn the keywordsResemblance of Rain Fall in Bangladesh with Correlation Dimension and Neural Network LearningAbu Nasir Mohammad Enamul Kabir, Hussain Muhammad Imran Hasan, Mohd Abdur Rashid et al.Rain fall and Temperature are undoubtedly two important factors that balance water in the environment. Adequate study of the rain behavior helps to forecast it. The time series obtained from different stations of the country throughout the several years are collected and analyzed. The dynamics of rain fall time series is analyzed with Correlation Dimension (CD) to characterize the several … …American Journal of Applied Sciences, Vol. 10, Issue 10 · 5 Sep 2013 · 7,234 accessesView PDFCite