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.
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… 
2009
2009
We study the classes of filters F on N such that the weak and strong F-convergence of sequences in l1 coincide. We study also an… 
2008
2008
This paper presents the performance evaluation and comparisons of three typical control strategies for three-level neutral point… 
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… 
2001
2001
The quality of radio astronomical images drastically depends on where we place the radio telescopes. During the design of the… 
2000
2000
Three pulse-width modulation (PWM) control schemes for a single-phase power-factor-correction (PFC) AC/DC converter are presented… 
1999
1999
This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP…