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.
Review
2016
Review
2016
Advances in Converter Control and Innovative Exploitation of Additional Degrees of Freedom for Multiphase Machines
  • E. Levi
  • IEEE transactions on industrial electronics…
  • 2016
  • Corpus ID: 24622162
Multiphase variable-speed drives and generation systems (systems with more than three phases) have become one of the mainstream… 
Highly Cited
2012
Highly Cited
2012
Learning Topic Models -- Going beyond SVD
Topic Modeling is an approach used for automatic comprehension and classification of data in a variety of settings, and perhaps… 
Highly Cited
2010
Highly Cited
2010
Elastic Bandwidth Allocation in Flexible OFDM-Based Optical Networks - (Invited Paper)
Orthogonal Frequency Division Multiplexing (OFDM) has recently been proposed as a modulation technique for optical networks… 
Highly Cited
2010
Highly Cited
2010
Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on… 
Highly Cited
2009
Highly Cited
2009
On problems without polynomial kernels
Review
2008
Review
2008
A Survey of NP-Complete Puzzles
Single-player games (often called puzzles) have received considerable attention from the scientific community. Consequently… 
Highly Cited
2005
Highly Cited
2005
A Spectral Clustering Approach To Finding Communities in Graph
Clustering nodes in a graph is a useful general technique in data mining of large network data sets. In this context, Newman and… 
Highly Cited
2005
Highly Cited
2005
Retrieval of biomass combustion rates and totals from fire radiative power observations: FRP derivation and calibration relationships between biomass consumption and fire radiative energy release
Estimates of wildfire aerosol and trace gas emissions are most commonly derived from assessments of biomass combusted. The… 
Review
2000
Review
2000
A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks
This study focuses on the routing and WavelengthAssignment (RWA) problem in wavelength-routed optical WDM networks. Most of the… 
Highly Cited
1999
Highly Cited
1999
Series P Systems with Active Membranes : Attacking NP Complete Problems
P systems are parallel Molecular Computing models based on processing multisets of objects in cell-like membrane structures… 
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)