China
Africa
Explore chapters and articles related to this topic
Lightweight Cryptography for Low Cost RFID: A New Direction in Cryptography
Published in Syed Ahson, Mohammad Ilyas, RFID Handbook, 2017
Damith C. Ranasinghe, Raja Ghosal, Alfio Grasso, Peter H. Cole
Complexity classes, as shown in Figure 31.2, provide ahead of any design or implementation a classification of problems based on the type of computing machine and the computing resources required to solve the problems or execute the algorithms. The simplest set P, are a set of problems that can be solved by an algorithm in polynomial time using a deterministic Turing machine. NP class of problems can be solved by an algorithm using a nondeterministic Turing machine in polynomial time, however, for NP-complete problems there is no known polynomial time solution.
Optimizing a redundancy allocation problem with open-circuit and short-circuit failure modes at the component and subsystem levels
Published in Engineering Optimization, 2021
Mani Sharifi, Sharareh Taghipour
‘NP hard’ refers to the class of optimization problems which cannot be solved in a polynomial time by a non-deterministic Turing machine. Chern (1992) proved that RAP is NP hard. However, several studies have used exact methods to solve the RAP for small-size problems. For example, Fyffe, Hines, and Lee (1968) solved the RAP using a computational algorithm based on dynamic programming. Coit (2001) worked on a RAP with a time-dependent failure rate of components and presented a novel methodology to solve the model using exact methods using HYPER-LINDO software.
Exact and Approximation Algorithms for Minimizing Energy in Wireless Sensor Data Gathering Network with Data Compression
Published in American Journal of Mathematical and Management Sciences, 2022
Next we prove that Problem DG-Compr-DvE and thus the general Problem DG-Compr-DvE, is NP-complete, where a problem in “NP” means that the problem can be solved in polynomial time using a Non-deterministic Turing machine and a known “NP” problem can be reduced to the given problem then the given problem is NP-complete (Garey & Johnson, 1991).