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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Students’ performance and motivation are influenced by their emotions. Game-based learning (GBL) environments comprise elements… 
2012
2012
The Darwinian Particle Swarm Optimization (DPSO) is an evolutionary algorithm that extends the Particle Swarm Optimization using… 
2011
2011
Multilevel converters offer advantages in terms of the output waveform quality due to the increased number of levels used in the… 
Review
2009
Review
2009
This report identifies and describes what current evidence indicates are the main behavioral and contextual factors that are… 
2007
2007
Due to the increased use of renewable energy and power electronic applications, more multilevel converters (MLC) are developed. A… 
2005
2005
This paper compares a three-level neutral point clamped voltage source converter (3L-NPC VSC), a three-level flying capacitor… 
Highly Cited
2003
Highly Cited
2003
Foreword.Preface.1. Fundamental Logic and the Definition of Engineering Tasks.Three Types of Inference.Engineering Tasks.A Model… 
2000
2000
Three pulse-width modulation (PWM) control schemes for a single-phase power-factor-correction (PFC) AC/DC converter are presented… 
2000
2000
A matching M of a graph G is induced, if M is an induced subgraph of G. A graph G is induced matching extendable (simply IM…