Skip to search formSkip to main contentSkip to account menu

NC (complexity)

Known as: NC = P problem, BWBP, NC1 (complexity) 
In complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
Cancer may not be completely the result of novel or inherited genetic mutations but may in fact be a largely preventable disease… 
2011
2011
The detection of changes between OWL ontologies is an important service for ontology engineering. There are several approaches to… 
2008
2008
Cooperative Peer-to-Peer Repair (CPR) has been proposed to recover from packet losses incurred during 3G broadcast. CPR leverages… 
2007
2007
The effect of small additives (1.25–5.00%) of ultrafine aluminum powders (UFAP) on the rheology and combustion of model four… 
2005
2005
Modern manufacturing enterprises are built from facilities spread around the globe, which contain equipment from hundreds of… 
2003
2003
We present a pseudopotential calculation of the single particle and excitonic spectrum of CdSe nanocrystals. We find that in the… 
2002
2002
Based on gauge invariance, we show that the new threshold phenomenon is discovered in the φ radiative decays φ → γa 0 → γπ 0… 
1981
1981
2014 A nematic liquid crystal, oriented homeotropically (n//z) between two parallel plates (~ z) in relative motion x = x0 sin… 
1975
1975
1956
1956
1. Although fresh-run lamperns are able to withstand the effects of increasing sea-water concentration better than maturing…