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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1937-2018
0500100019372017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
of greenhouse gases in the atmosphere (IPCC, 2001), and ability of our agricultural systems to sustain producSociety is facing… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
611 Electrons propagating through the bidimensional structure of graphene have a linear relation between energy and momentum, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Since the advent of the theory of evolutio n, o ne of the tasks of biology has bee n to i nvestigate the phyloge netic relatio… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Although the prospect of computerized homes has a long history, ho/ne automation has never become terribly popular because the… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
ne of the most common tasks in image processing is to alter an image's color. Often this means removing a dominant and… (More)
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The… (More)
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1994
Highly Cited
1994
No feature-based vision system can work unless good features can be identi ed and tracked from frame to frame. Although tracking… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In this work we address the problem of occlusion in tracking multiple 3D objects in a known environment and propose a new… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
-This article introduces a new neural network architecture, called A R T M A P , that autonomously learns to class(~v arbitrarily… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1975
Highly Cited
1975
The joint e q u i h b r m m dis t r ibut ion of queue sizes in a network of queues conta in ing N service centers and R classes… (More)
  • figure 3
  • figure 5
  • figure 6
Is this relevant?