Skip to search formSkip to main contentSkip to account menu

NE (complexity)

Known as: NE 
In computational complexity theory, the complexity class NE is the set of decision problems that can be solved by a non-deterministic Turing machine… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A 2-D axial-azimuthal model of an annular Hall thruster discharge is developed. We use a hybrid fluid-particle-in-cell (PIC… 
2014
2014
Beamforming techniques for aeroacoustics applications have undergone significant advances over the past decade to account for… 
2011
2011
NASA has developed a capability for terminal area precision scheduling and spacing (TAPSS) to increase the use of fuel-efficient… 
Review
2009
Review
2009
ABSTRACT Recently acquired aeromagnetic data for the Falkland Islands have shown that previous interpretations of the dolerite… 
2008
2008
Word sense disambiguation (WSD) methods evolve towards exploring all of the available semantic information that word thesauri… 
Review
1998
Review
1998
A goal of software quality modeling is to recommend modules for reliability enhancement early enough to prevent poor quality… 
1985
1985
In this paper, recent research results are presented which demonstrate the effectiveness of a rule learning system in two dynamic…