Skip to search formSkip to main contentSkip to account menu

NP-completeness

Known as: Non-deterministic polynomial-time complete, NPC, NP 
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. The set of NP-complete problems is often… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AC0Abstract machineAsymptotic computational complexityCo-NP

Broader (1)

Mathematical optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Modeling and control of a gird connected PV generation system
This paper presents the analysis, modelling and control model of the electric part of a grid connected photovoltaic generation… 
Highly Cited
2009
Highly Cited
2009
Three-Level AC-DC-AC Z-Source Converter Using Reduced Passive Component Count
This paper presents a three-level ac-dc-ac Z-source converter with output voltage buck-boost capability. The converter is… 
Highly Cited
2008
Highly Cited
2008
On recovering syntenic blocks from comparative maps
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in… 
Highly Cited
2004
Highly Cited
2004
Design and comparison of medium voltage multi-level converters for industry applications
This paper describes the design of a (2.3 kV, 2.4 MVA) two-level -, three-level - neutral point clamped -, three-level - flying… 
Highly Cited
2003
Highly Cited
2003
Comparison of state-of-the-art voltage source converter topologies for medium voltage applications
This paper compares a two level voltage source converter (2L-VSC), a three-level neutral point clamped voltage source converter… 
Highly Cited
2003
Highly Cited
2003
Low Power 0 / 1 Coverage and Scheduling Techniques in Sensor Networks
Distributed embedded systems have recently emerged as an economically attractive and technically challenging research direction… 
Highly Cited
2003
Highly Cited
2003
The full Steiner tree problem
Highly Cited
1999
Highly Cited
1999
A five-level neutral-point-clamped H-bridge PWM inverter with superior harmonics suppression: a theoretical analysis
A new control strategy for a five-level neutral-point-clamped (NPC) H-bridge PWM inverter is proposed. It is shown that a three… 
Highly Cited
1998
Highly Cited
1998
Improved genetic operators for structural engineering optimization
1997
1997
Two NP-Complete Augmentation Problems
We prove that the Simplicity Preserving Edge-Connectivity Augmentation Problem and the problem of Increasing Edge-Connectivity by… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)