Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is NP-Hard

Chapter 14
Encyclopedia of Information Science and Technology, Third Edition
A problem is called hard if the solution time is an exponential function of its problem size. NP-hard means that non-deterministic polynomial time (NP) hard, which has no efficient algorithms to find its solutions.
Published in Chapter:
Cuckoo Search for Optimization and Computational Intelligence
Xin-She Yang (School of Science and Technology, Middlesex University, UK) and Suash Deb (Cambridge Institute of Technology, India)
Copyright: © 2015 |Pages: 10
DOI: 10.4018/978-1-4666-5888-2.ch014
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR